Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<int>>;
using Graph = vector<vector<int>>;
using VI = vector<int>;
using VC = vector<char>;
using PI = pair<int, int>;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) x.begin(), x.end()
const long long INF ... | 484 |
Project_CodeNet | 2,020 | // Last Change: 04/20/2020 17:19:39.
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <s... | 453 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define RI register int
typedef long long LL;
#define int LL
#define FILEIO(name) freopen(name".in", "r", stdin), freopen(name".out", "w", stdout);
using namespace std;
char buf[1000000], *p1 = buf, *p2 = buf;
inline char gc() {
if (p1 == p2) p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin)... | 548 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char c) { string s = "'"; s += c; return s + "'"; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typ... | 905 |
Project_CodeNet | 2,020 | //Keep Working Hard
// I__Like__Food
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define all(v) v.begin(),v.end()
#define f first
#define s second
#define PB push_back
#define MP make_pair
#define double long do... | 752 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pi pair<int,int>
#define all(v) (v).begin(),(v... | 451 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define fo(i,a,b) for(int i=(a);i<(b);i++)
#define qi queue<int>
#define vi vector<int>
#define ll long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int,int>
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define fi first
#define se second
... | 461 |
Project_CodeNet | 2,020 | #include <iostream>
#include <fstream>
#include <algorithm>
#include <chrono>
#include <random>
#include <vector>
#include <string>
#include <cmath>
#include <bitset>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#define sq(x) ((x) * (x))
#define err(x) cerr << "["#... | 943 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vpii=vector<pii>;
struct yo
{
ll g;
int a, n;
bool operator<(const yo&rhs) const
{
return a<rh... | 438 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N;
cin>>N;
ll dp[2020][2020],ans=0;
vector<pair<ll,int>> A(N);
for(int i=0;i<N;i++){
cin>>A.at(i).first;
A.at(i).second=i;
}
sort(A.begin(),A.end(),greater<pair<ll,int>>());
for(int j=1;j<=... | 280 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
class in{
public:
long long s, n;
bool operator<(const in& another) const{
return s > another.s;
}
};
void solve(){
int n; cin >> n;
vector<in> a(n + 1);
for(int i = 0; i < n; i++){
cin >> a[i + 1].s;
... | 486 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | 436 |
Project_CodeNet | 2,020 | // Winners don't quit and Quitters don't win
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vii vector<int>
#define vll vector<ll>
#define mod 998244353
#define MAX 100005
ll dp[2003][2003];
int main()
{
ios_base::... | 312 |
Project_CodeNet | 2,020 | //#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <tuple>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <bitse... | 2,428 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define _LL long long
#define rep(i, n) for (_LL i = 0; i < (_LL)(n); i++)
_LL dp[2004][2004];
int main()
{
_LL n;
cin >> n;
pair<_LL, _LL> *a = new pair<_LL, _LL>[n];
rep(i, n)
{
cin >> a[i].first;
a[i].second = i;
... | 360 |
Project_CodeNet | 2,020 | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
//#define double long double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
const int INF = 1e9;
const int MB = 30;
const int MOD = 1e9 + 7;
c... | 442 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
const long long INF = 1LL << 60;
const int MOD = 1e9 + 7;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }... | 462 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i <= n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... | 533 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | 659 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <algorithm>
#include <tuple>
#include <functional>
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
ll n, a[2100];
pii s[2100];
ll dp[2100][2100];
int main() {
scanf("%lld", &n);
for (int i = 0; i < n; i++)
scanf("%lld", a + i);
for (int i = 0; i < n; i++)
s[i] = ... | 321 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#def... | 390 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main() {
int N;
cin >> N;
vector<p... | 468 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <time.h>
#define ll ... | 641 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 617 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | 507 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
ll dp[2005][2005];
bool comp(p2 a,p2 b){
return a.first>b.first;
}
void solve(){
ll n;
cin>>n;
vector<p2> v(n);
for(ll i=0;i<n;i++){
cin>>v[i].first;
v[i].second=i;
}
sort(v.begin(),v.end(),... | 280 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
typedef long long ll;
pair<int, int> a[200010], f[10001];
ll dp[2010][2010];
int main()
{
int n, k;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i].first);
a[i].second = i;
}
sort(a + 1, a + 1 + n... | 309 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <unordered_map>
// #include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).en... | 1,267 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast,inline,unroll-loops,fast-math")
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <functional>
#define N 2020
using namespace std;
pair<int, int> a[N];
long long f[N][N];
int main(void)
{
int n;
int i, j;
cin >> n;
for(i = 1; i <= n; i ... | 293 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define repf(i, f, l) for(int i = f; i < (int)l; ++i)
#define repit(it, t) for(__typeof((t).begin()) it = (t).begin(); it != (t).end(); it++)
#define endl "\n"
#define pb emplace_back
#define int long long
#define lb lower_... | 633 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <set>
#include <cstdio>
#include <vector>
#include <iostream>
#include <utility>
#include <queue>
#include <map>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d",&n);
#define gets(s) stri... | 1,758 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include<iostream>
#define pb push_back
#define fi first
#define se second
#define sz(x) x.size()
#define cl(x) x.clear()
#define all(x) x.begin() , x.end()
#define r(x) s... | 796 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int,int> P;
using Graph = vector<vector<int>>;
signed main(){
cin.tie(nullptr);
ios::sync_with_st... | 288 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
const long long llINF = 9223372036854775807;
const int INF = 2147483647;
const int maxn = 2e3 + 7;
const int maxm = 1e5 + 7;
const int mod = 998244353;
int n;
pair<int,int> a[maxn];
long long dp[maxn][maxn]; //1: 往左，2：往右
long long ans;
void debug()
{
for(int i=0;i<=n;i++)... | 384 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | 525 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2001;
struct kid{
int val;
int pos;
bool operator<(const kid &a) const{
return val>a.val;
}
};
kid a[N];
int dp[N][N];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
for(int i=0;i<n... | 257 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <fstream>
using namespace std;
// long long mod = 998244353;
long long mod = 1000000007;
vector<long long> fact(1000001);
vector<long long> invFact(1... | 1,608 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define rep(i,n,z) for(int i=z;i<n;i++)
#define rrep(i,z) for(int i=z;i>=0;i--)
#define nl cout<<endl
#define vi vector<int>
#define vlli vector<long long int>
#define umap u... | 509 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | 852 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define x first
#d... | 342 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define fastIO std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0)
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#defin... | 513 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>
#include <math.h>
#include <cmath>
#include<complex>
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#i... | 493 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | 435 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll ... | 389 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int (i) = 0; i < (n); ++(i))
using ll = long long int;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
int main() {
int N;
std::cin >> N;
std::vector<std::pair<ll, int>> A(N);
rep(i, N) {
ll a;
std::cin >> a;
A[i] = {a, i};
}
std::sort(A.rbeg... | 342 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
template<class A, class B> ostream& operator <<(ostream& out, const pair<A, B> &p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template<class A> ostream& operator <<(ostream& out, const vector<A> &v) {
... | 607 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
ll ans;
ll N;
pair<ll,ll> A[2005];
ll dp[2005][2005];
int main(){
cin >> N;
for(ll i = 0;i<N;i++){
ll a;
cin >> a;
A... | 313 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <algorithm>
#define N 2005
#define PR pair<ll,ll>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n, ans, d[N][N];
pair<ll, ll> a[N];
int main() {
ll i, j, k;
cin >> n;
for(i=0; i<n; i++) scanf("%lld", &a[i].F), a[i].S = i;
sort(a, a+n, ... | 249 |
Project_CodeNet | 2,020 | // ZapZu's code hohoho
// #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define dfs_black 1
#define dfs_white -1
#define pr... | 496 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
... | 534 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
#define endl '\n'
#define ff first
#define ss second
#define int long long
#define pb push_back
#define f(i,l,r) for(ll i=l;i<=r;i++)
#define rf(i,r,l) for(ll i=r;i>=l;i--)... | 554 |
Project_CodeNet | 2,020 | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const&
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) \
for (default_counter_t i = 0, end_i = default... | 1,426 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <nume... | 511 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL
#include<debug.h>
#else
#define db(...) 21
#endif
#define found(m,x) ((m).find(x)!=(m).end())
#define uset unordered_set
#define umap unordered_map
#define a(x) x.begin(),x.end()
template<typename T1,typename T2> inline void chmin(T1 &a,T2 ... | 529 |
Project_CodeNet | 2,020 | // Active Infants 動的計画法 ソート
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
int main(){
int N;
cin>>N;
vector<long long> a(N);
rep(i,N){
cin>>a[i];
}
vector<int> index(a.size());
iota(index.begin(), index.end(), 0); // indexに0から順に代入
sort(
i... | 510 |
Project_CodeNet | 2,020 | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 10000... | 461 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<pair<int,int>> v(N);
for (int i = 0; i < N; ++i) {
v[i].first = i;
cin >> v[i].second;
}
sort(v.begin(), v.end(), [](const pair<int,int>... | 331 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long dp[2010][2010];
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<long long> a(n);
for (auto &x: a) cin >> x;
vector<int> c(n);
int curr = 0;
for (auto &x: c) x = curr++;
auto cmp = [&](int i,... | 308 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
#define pb push_back
using ll = long long;
using P = pair<ll,ll>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<cl... | 560 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2002;
pair<int,int> arr[N];
int dp[N][N];
int solve(int i,int l,int r)
{
if(l > r) return 0;
int & ans = dp[l][r];
if(ans != -1) return ans;
ans = 0;
// place at left
ans = arr[i].first*abs(l - arr[i].second) ... | 235 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int n;
long long dp[2005][2005];
vector<pair<long long,int> > v;
long long solve(int l,int r)
{
if (r<l)
return 0;
if (dp[l][r]!=-1)
return dp[l][r];
int i=l+n-r-1;
return dp[l][r]=max(v[i].first*abs(v[i].second-l)+solve(l+1,r),v[i].first*abs(v[i].second-r)+solve(l,r-... | 190 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define db double
#define RE register
#define ll long long
#define P=1000000009
#define INF 1000000000
#define get(x) x=read()
#define pair<ll,int> PLI
#define pb(x) push_back(x)
#define pair<int,int> PII
#define ull unsigned long long
#define put(x) printf("%d\n",x)
#define getc(a) scanf("%s",a... | 483 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const double pi=acos(-1.0);
const int N=2e3+10;
typedef long long ll;
struct p{
int index;
int t;
}a[N];
int cmp(p x,p y){
return x.t>y.t;
}
ll dp[N][N];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++){
a[i].index=i;
cin>>a[i].t;
}
... | 264 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d> >... | 485 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef unordered_set<int> si;
typedef pair<int, int> pp;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define all(e) (e).begin(), (e).en... | 644 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define IN... | 582 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typed... | 555 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<math.h>
#include<queue>
#include<deque>
#include<stack>
#include<cstdio>
#include<utility>
#include<set>
#include<list>
#include<cmath>
#include<stdio.h>
#include<string.h>
#include<iomanip>
#include<cstdio>
#include<cstdlib... | 1,106 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int,int>
#define pb push_back
const int N = 2005;
P a[N];
int n, memo[N][N];
int dp(int i, int fs, int ls) {
if (i == n) {
return 0;
}
if (memo[i][fs] != -1) return mem... | 326 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define pp push_back
#define fr first
#define sc second
using namespace std;
ll n;
pair<ll,ll>a[2002];
ll dp[2002][2020];
ll solve(int i,int j){
if(i > n)return 0;
ll &ret = dp[i][j];
if(ret + 1)return ret;
ret = 0;
ll v = a[i].fr;
ll d1 = abs(a[i]... | 291 |
Project_CodeNet | 2,020 | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 498 |
Project_CodeNet | 2,020 |
#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <bitset>
#include <ioman... | 1,368 |
Project_CodeNet | 2,020 | #pragma GCC target("avx")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define ST string
#define BS bitset
#define PA pair<LL,LL>
#define VE vector
... | 1,290 |
Project_CodeNet | 2,020 | #include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <fstream>
#include <map>
#include <string>
#include <sstream>
#include <queue>
#include <iomanip>
#include <set>
using namespace std;
#define ll long long int
int brute_force(vector<int>&A){
... | 847 |
Project_CodeNet | 2,020 | // God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug p... | 533 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<pair<ll, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i + 1;
}
sort(a.rbegin(), a.rend());
vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, 0));
... | 320 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define dump(x) cerr << #x << " = " << (x) << endl
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " ... | 487 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
long long int INF = 2e18;
const ll fact_table = 1200008;
double Pi = 3.1415926535897932384626;
priority_queue <ll> pql;
priority_queue <P... | 1,034 |
Project_CodeNet | 2,020 | #line 2 "lib/template.cpp"
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using VI = vector... | 1,434 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int N;
pair<int,int> P[2020];
ll dp[2020][2020];
int main() {
cin >> N;
vector<pair<int, int> > P(N);
for(int i = 0; i < N; i++) {
int x;
cin >> x;
P[i] = make_pair(x, i);
}
sort(P.begin(), P.end(), greater<p... | 426 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 462 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 2020;
int n;
pair<ll,ll> a[maxn];
ll dp[maxn][maxn];
ll f(int l, int r) {
if (l>... | 308 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define db(x) cout << (x) << '\n';
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pii;
typedef pair<double,ll> pdi;
typedef pair<string,ll> psi;
typedef pair<ll,string> pls;
type... | 357 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long int
#define lld long double
#define pb push_back
#define pii pair<ll,ll>
#define mi map<ll,ll>
#define vec vector<ll>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define mod... | 901 |
Project_CodeNet | 2,020 | //Author: Abitnav
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(i=0;i<n;i++)
#define pb push_back
#define all(a) a.begin(),a.end()
#define fi first
#define se second
vector<pair<int,int> > v;
int dp[2001][2001];
int solve(int i,int l){
if(i==v.size()) return 0;
int r=l+v.si... | 292 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define vi vector<ll int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S secon... | 747 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>
using i64 = long long;
int main() {
int n;
std::cin >> n;
std::vector<std::pair<i64, int>> v;
for (int i = 0; i < n; i++) {
i64 a;
std::cin >> a;
v.emplace_back(a, i);
}
... | 275 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
int main(){
int N;
cin >> N;
vector<P> a(N);
for(int i = 0 ; i < N; i++) {
long long b;
cin >> b;
a[i] = P(b, i);
}
sort(a.begin(), a.end());
long long dp[N + 1][N + 1];
long long ... | 407 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define repr(i,from,to) for(int (i)=(from);(i)<(to);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// const bool debug=true;
const bool debug=false;
#define DEBUG if(debug==true)
#define all(x) begin((x)), end((x))
#define vprint(x) for(auto a:(x)) cout << x << endl;
using namespace std;
... | 470 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2010;
ll a[N],n,b[N],ans;
ll dp[N][N];
ll m[N],vis[N];
bool cmp(ll a,ll b){
return a>b;
}
int main()
{
//freopen("in.txt","r",stdin);
scanf("%lld",&n);
for(ll i=1;i<=n;++i){
scanf("%lld",&a[i]);
//printf("%lld ",a[i]);
b[i]=a[i];
}... | 446 |
Project_CodeNet | 2,020 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi 3.14159265
#define EPS 1e-8
#define mod 1000000007
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define endl "\n"
const ll INF=(ll)3e17;
ll memo[2005][2005];
vector<pair<ll,ll> > v;
ll ... | 314 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = ... | 979 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define lld long long
#define pi pair<int,int>
#define pl pair<lld,lld>
#define mem0(x) memset(x,0,sizeof(x))
#define fillnum(x,n) fill(begin(x),end(x),n)
int n;
vector<pl> a;
lld dp[2001][2001];
lld solved(int left,int right){
if(left+right == n) return 0;
if(dp[... | 287 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
constexpr int Mod = 9982443... | 470 |
Project_CodeNet | 2,020 | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
bool cmp(const pair<ll,ll>& a, const pair<ll,ll>& b)
{
return a.first < b.first;
}
int main()
{
ll n;
cin>>n;
vector<vector<ll>> dp(n + 1, vector<ll>(n + 1));
vector<pair<ll, ll >> a(n) ;
for(ll i = 0;i<n;i++... | 285 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(... | 922 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int maxn = 2020;
const int mod = 1e9 + 7;
ll a[maxn];
ll dp[maxn][maxn];
bool cmp(const pair<ll, ll> &a, const pair<ll, ll> &b){
return a.first > b.first;
}
void solve(){
in... | 473 |
Project_CodeNet | 2,020 | // Igorjan94, template version from 13 October 2017. C++17 version, modified 18 march 2020 (writeln<tuple>, whole->all) {{{
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <iomanip>
#include <set>
using namespace std;
#define FOR(i, m, n) for (int i = m; i < (int... | 1,032 |
Project_CodeNet | 2,020 | #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _ov... | 698 |
Project_CodeNet | 2,020 | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#include <random>
#include <map>
#include <unordered_map>
#include <cstdlib>
... | 692 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.