Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include <iostream>
#include <tuple>
#include <vector>
#include <cassert>
#include <algorithm>
using namespace std;
template<class T>
vector<T> VEC(int n, T t){
return vector<T>(n, t);
}
template<class ...Ts>
auto VEC(int n, Ts ... ts){
return vector<decltype(VEC(ts...))>(n, VEC(ts...));
}
template<class T> ... | 482 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((... | 804 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf = 1e9;
int n, a;
vector<pair<int, int> > vec;;
struct sorter{
bool operator()(const pair<int,int> & a, const pair<int,int> & b){
return a.second > b.second;
}
};
const int maxn = 2e3+5;
long long dp[maxn][m... | 355 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e3+5;
ll dp[N][N];
struct p{
int x,id;
bool operator<(const p&a)const{
return x>a.x;
}
}a[N];
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i].x),a[i].id=i;
sort(a+1,a+n+1);//从大到小排序
for(int k=1;k<=n;k+... | 345 |
Project_CodeNet | 2,020 | #include <iostream>
#include<algorithm>
#include<vector>
#define ll long long
using namespace std;
ll dp[2000 + 100][2000 + 100];
int main() {
ll N; cin >> N;
vector<pair<int, int>> A(N);
for (ll i = 0; i < N; i++) {
cin >> A[i].first;
A[i].second = i;
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end())... | 281 |
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
#define mod 1000000007
#define inf 1e18
#define endl '\n'
const int N = 2e3 + 5; //change it when needed
int cache[N][N];
P a[N];
int n... | 356 |
Project_CodeNet | 2,020 | /// __Macro's__
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define II pair<int,int>
#define III pair<int, II>
#define VI vector<int>
#define VII vector<II>
#define VIII vector<III>
#define VVI... | 1,260 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
const int N = 200005;
int n;
vector<pair<int, int> > v;
ll memo[2000][2000];
ll solve(int *arr, int i, int l, int r) {
if (i==n) {
return 0;
}
if (memo[l][r] != -1) {
return memo[l][r];
}
ll ans1 = solve(arr, i + 1, l + 1, r) + (1LL * v... | 350 |
Project_CodeNet | 2,020 | /*
AuThOr GaRyMr
*/
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdout)
#define rep(a,b) for(... | 505 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec... | 656 |
Project_CodeNet | 2,020 | #include <iostream>
#include <bitset>
#include <string>
#include <vector>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <deque>
#include <algorithm>
#include <random>
#include <iomanip>
using namespace std;
const int mod = 1e... | 428 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
void max_self(long long& a , long long b){
a = max(a , b);
}
int main() {
int n ; cin>>n;
vector<pair<long long, int> > v;
for(int i = 0 ; i < n; ++i){
long long x ; cin>>x;
v.emplace_back(x , i);
}
sort(v.rbegin() , v.rend());
vector<long long>dp(n... | 274 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define fastio
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ld long double
#define forn(low,high,i) for(i = low; i < high; i++)
#define forrev(high,low,i) for(i = high; i >= low; i--)
#define all(v) v.begin(),v.... | 1,011 |
Project_CodeNet | 2,020 | /* ****revpro**** */
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll,ll>
#define vi vector<ll>
#define all(a) ... | 649 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const double PI = acos(-1);
inline void chmax(ll& a, ll b){
a =max(a,b);
}
const ll INF=1e18;
const int MX=2005;
ll dp[MX][MX];
int main(){
int n;
cin >>n;
vector<int> a(n... | 303 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL n,a[2010],dp[2010][2010],b[2010],ans=0;
bo... | 346 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE( cout << #x" = " << x << endl)
#define PRINT(x) TRACE(printf(x))
#define WATCHR(a, b) TRACE( for(auto c = a; c != b;) cout << *(c++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end()); } )
#de... | 579 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
long long N;
cin >> N;
long long A;
vector<pair<long long, long long> > val_index;
val_index.push_back(make_pair(-1,-1));
for(long long i=0; i<N; i++){
cin >> A;
val_index.push_back(make_pai... | 413 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | 366 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define PII pair<ll,ll>
const ll sz=2010;
ll dp[sz][sz];
ll n;
PII val[sz];
ll cholo(ll l,ll r,ll id)
{
if(id>=n){
return 0;
}
ll &ret=dp[l][r];
if(~ret) return ret;
ll mx=cholo(l+1,r,id+1)+(val[id].first*abs(l-val[id]... | 233 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <stdio.h>
#i... | 698 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2005
struct Info{
bool operator<(const struct Info &arg) const{
return value > a... | 516 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
usin... | 386 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>... | 943 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin()... | 895 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pii pair<long long,long long>
using namespace std;
int MOD = (1e9)+7;
const int N = 2005;
pii a[N];
int dp[N][N],n;
int rec(int l,int r)
{
if(l>r)
return 0;
if(dp[l][r]!=-1)
return dp[l][r];
int id = ... | 249 |
Project_CodeNet | 2,020 | #include <iostream>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <string.h>
using namespace std;
// #define for(i,a,b) for (int i=(a);i<(b);++i)
typedef long long ll;
typedef pair<ll,ll> P;
#define... | 682 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template<class T>
bool chmax(T& a, const T& b) {
if (a < b) { a = b; return true; }
return false;
}
template<class T>
bool chmin(T& a, const T& b) {
if (b < a) { a = b; return true; }
return false;
}
// std::vector Declaration
template<typename T>
vector<T... | 1,390 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e3+5;
long long dp[maxn][maxn];
int n;
struct person{
long long x,a;
} e[maxn];
bool cmp(person g,person h){
return g.a > h.a;
}
int main(){
cin >> n;
for (long long i=1;i<=n;i++) {cin>>e[i].a;e[i].x=i;}
sort(e+1,e+n+1,cmp);
for (long long i=1;i<=n... | 290 |
Project_CodeNet | 2,020 | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 858 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MAX 200003
#define MOD 1000000007
int main(){
int N;
cin>>N;
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());
reverse(A.begin(),A.end());
vector<vector<ll... | 409 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define ll long long
#define ld long double
#define pii pair <int,int>
#define pll pair <ll,ll>
#define pil pair <int,ll>
#define pli pair <ll,int>
#define ull unsigned long long
#define pdd pair <double,double>
#define pb push_back
#define ... | 542 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define two(a) (1<<(a))
#define LINF (1ll<<61)
#define EPS (1e-14)
#define Lshift(a,b) ((a)<<(b))
#define Rshift(a,b) ((a)>>(b))
#define rep(a,b) for(a=0 ; a<b ; a++)
#define xrep(a,b,c) for(a=b ; a<c ; a++)
#define INF (1<<29)
#define sz(a) int(a.size())
#define swap(a,b) ( (a^=b) , (b^=a) , (a... | 547 |
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>
#define simplify ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long
#define endl "\n"
using namespace std;
vector<pair<int,int>>arr;
int dp[2005][2005];
int n;
int solve(int pos,int left, int right){
if(pos>=n)return 0;
if(left>right)return -1e10;
int &ans=d... | 262 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <cassert>
#include <cstring>
#include <algorithm>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
long long memo[2020][2020];
std::pair<long long, int> a[2020];
long long dp(int l, int r, int on) {
... | 282 |
Project_CodeNet | 2,020 | #include <iostream>
#include <fstream>
#include <iomanip>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <string>
#include <string.h>
#include <sstream>
#include <ctime>
using namesp... | 419 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <iomanip>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll dp[2000][2001];
int main() {
int n;
cin >> n;
vector<pair<ll, ll> > a(n);
rep(i, n) {a[i].second = i; cin >> a[i].first;}
sort(a.begin(), a.end()... | 386 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
int main(){
int n; scanf("%d",&n);
vector<lint> a(n);
rep(i,n) scanf("%lld",&a[i]);
vector<pair<lint,int>> p(n);
rep(i,n) p[i]={a[i],i};
sort(p.rbegin(),p.rend());
static lint dp[2001][2001];
rep(i,n... | 267 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long LL;
int a[2005];
LL dp[2005][2005];
pii p[2005];
int n;
LL dfs(int s, int e){
if(dp[s][e] != -1) return dp[s][e];
if(s > e) return 0;
int idx = 1 + (s-1) + (n-e);
dp[s][e] = max(dfs(s+1, e) + p[idx].first*1ll*abs... | 248 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define LL long long int
#define MAXN 2000
int N;
LL dp[MAXN + 3][MAXN + 3];
pair<int, int> A[MAXN + 3];
LL solve(int l, int r) {
if (l > r)
return 0;
if (dp[l][r] != -1)
return dp[l][r];
int idx = N - (r - l + 1) + 1;
LL goLeft = (LL) abs... | 281 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se secon... | 606 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int n;
P p[2020];
ll dp[2020][2020];
ll solve(){
rep(i,n){
int a;
cin>>a;
p[i]=P(... | 297 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
pair<long long, long long>v[n + 3];
for(long long i = 1; i <= n; i++){
long long x;
cin >> x;
v[i] = {x, i};
}
sort(v + 1, v + n + 1, greater<pair<long long, long long> >());
long long dp[... | 366 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll x = 0): x((x % MOD + MOD) % MOD){}
mint operator-() const {return mint(-x)... | 17,861 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define sz(i) (int)(i.size())
#define F first
#define S second
#define L long double
#define P pair<int, int>
const int inf = 0x3f3f3f3f3f3f3f3LL;
const int mod = (int)1e9 + 7;
using namespace std;
#i... | 444 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
int main() {
int N;
cin>... | 485 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <functional>
#define int long long int
using namespace std;
int DP[2001][2001] = {0};
pair<int,int> val[2001];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
for(int i=1;i<=n;i++)
{cin>>val[i].first;
val[i].second =... | 304 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define INF 0x7ffffffffff
using namespace std;
const int N = 2005;
long long dp[N][N] = {};
pair<long long, int> arr[N];
int n;
inline bool cmp(const pair<long long , int> &a, const pair<long long , int> &b) {
return a.first > b.first;
}
long long DP(int l, int r) {
if (l < 0 || r > n +... | 341 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
typedef pair<ll, int> P;
#define fs first
#define sc second
ll INF = 1LL << 60;... | 410 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#def... | 994 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
void chmax(ll& a, ll b) { if (a < b) a = b; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<pair<int, int>> p(n);
rep(i, n) {
int a;
cin ... | 294 |
Project_CodeNet | 2,020 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <unordered_map>
#i... | 1,409 |
Project_CodeNet | 2,020 | // #include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <valarray>
#include <iterator>
#include <functional>
#include <limit... | 741 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
inline int read()
{
int sum=0,ff=1; char ch=getchar();
while(!isdigit(ch))
{
if(ch=='-') ff=-1;
ch=getchar();
}
while(isdigit(ch))
sum=sum*10+(ch^48),ch=getchar();
return sum*ff;
}
const int N=2005;
int n,m,f[N][N],a... | 335 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const int N = 2010;
int n;
pair <ll, int> a[N];
ll dp[N][N]; // dp[i][j] - prof cu primele i nr , j fiind plasate la stanga
int main(){
long long ans = 0;
cin >> n;
for (int i=1; i<=n; i++) cin >> a[i].f... | 324 |
Project_CodeNet | 2,020 | //
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
using namespace std;
using pll = pair<long long, long long>;
static const int maxlen = 2100;
long long dp[maxlen][maxlen];
int main()
{
long long N;
cin >> N;
vector<long long>... | 543 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<... | 375 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll; typedef vector<int> VI; typedef pair<ll,int> pii... | 393 |
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)
//现在区间从l到r 还没有放数
{
if (r<l) return 0;
if (dp[l][r]!=-1) return dp[l][r];
int i=l+n-r-1; //i 为 现在该放第 i 个数。那么它可能放在l的位置 或者 放在r的位置
long long temp1,temp2;
temp1 = v[i].first * ... | 332 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
std::cin.tie(n... | 467 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
ll mabs(ll a) {
return a > 0 ? a : -a;
}
int main(void) {
ll i, j, k, n, ans = 0, cnt = 0, now;
scanf("%lld", &n);
bool flg[n];
pair<ll, ll> p[n];
for(i = 0; i < n; ++i)
scanf("%lld", &p[i].first), p... | 455 |
Project_CodeNet | 2,020 | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i... | 795 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... | 513 |
Project_CodeNet | 2,020 | //by szh
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define SZ(x) (int((x).size()))
#define se second
#define ll long long
#define pq priority_queue
#define MP make_pair
#define pii pair<int,int>
#define mod 998244353
#define inf 0x3f3f3f3f
#define debug(x) cerr<<#x<<"="<<x<<'\n... | 355 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
int N;
pair<int,int> A[2000];
int dp[2001][2001];
int happiness(int i, int to) {
return abs(A[i].second - to) * A[i].first;
}
signed main() {
cin >> N;
for(int i=0; i<N; i++) {
int a; cin >> a;
A[i] = make_pair(a, i);
}
sort(A, A+N,... | 308 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef vector<vector<long long>> vvi;
int main() {
int N;
cin>>N;
vector<pair<long long,int>> a(N);
for (int i = 0; i < N; i++){
cin>>a[i].first;
a[i].second=i;
}
sort(a.begin(),a.end(),[](auto &a, auto &b){return a.first>b.first;});
vvi ... | 317 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<int(n); i++)
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
const ll mod = 1e9 + 7;
long long gcd(ll x, ll y){
if(x > y) swap(x, y);
while(x != 0){ y %= x; swap(x, y); }
return... | 471 |
Project_CodeNet | 2,020 | #include <iostream>
#include<cstdio>
#include <algorithm>
#include<string>
#include<queue>
using namespace std;
const int N=2020;
long long ans[N][N],sum;
int n;
struct node{
int val,id;
}a[N];
bool cmp(node x,node y){
return x.val>y.val;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf... | 271 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
vector<pair<ll, ll> > v;
ll dp[2222][2222], n;
int main(void)
{
ll a, i, j;
scanf("%lld", &n);
for (i = 1; i <= n; i++)
{
scanf("%lld", &a);
v.push_back(make_pair(a, i));
}
sort(v.begi... | 224 |
Project_CodeNet | 2,020 | //#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <sstream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cctype>
#include <cstdlib> // sran... | 4,315 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
long long INF = 1000000000000000000;
cin >> N;
vector<long long> A(N);
vector<pair<long long, int> > VP(N);
for (int i = 0; i < N; i++) cin >> A[i], VP[i] = { A[i], i };
sort(VP.begin(), VP.end(), greater<pair<long long, int> >());
vector<vector... | 308 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0)
//#define MULTI_TEST
//#define GOOGLE
#ifdef LOCAL
#include "debugger.h"
#else
#define db(...)
#endif
#define ll long long
#define v32 vector<int>
#define v64 vector<ll>
#define s32 set<i... | 631 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... | 709 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define maxn 1000005
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define F first
#define S second
#define all(x... | 339 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// その幼児の移動方向が決まれば，もともと並んでいた位置に関わらず，最適な移動後の位置が決定する
// 移動方向が右なら，最も列の先頭に近い位置だし，移動方向が左なら，最も列の末尾に近い位置になる
const ll INF = 1e18;
const int MX = 2005;
ll dp[MX][MX];
inline void chmax(ll &a, ll b)
{
a = max(a, b);
}
// dp[i][l]: 大きい順に並べたときの上位i個を対象に，l個を左... | 598 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define fr(i,n) for(int i=0;i<(n);++i)
#define foor(i,a,b) for(int i=(a);i<=(b);++i)
#define rf(i,n) for(int i=(n);i-->0;)
#define roof(i,b,a) for(int i=(b);i>=(a);--i)
#define elsif else if
#define all(x) x.begin(),x.end()
#define Sort(x) sort(all(x))
#define Reverse(x) reverse(all(x))
#define ... | 4,587 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(long long i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<ll, ll>;
const int mod = 1000000007;
ll dp[2005][20... | 372 |
Project_CodeNet | 2,020 | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;//例: VVI dp(10, vector<int>(10, INF);
typedef priority_queue<int, vector<int>, less<int> > QUE_int;
cons... | 2,127 |
Project_CodeNet | 2,020 | //Konrad Paluszek,University of Warsaw(former XIV LO Staszic)
//#STAY AT HOME
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#define TIME (chrono::steady_clock::now().time_since_epoch().count())
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define xfm(a,b)a##b
#de... | 1,906 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
#define INF 5000000000000000
using namespace std;
struct Edge{
int to;
long weight;
Edge(int t, long w) : to(t), weight(w) {}
};
long modpow(long a, long n, long mod) {
long res = 1;
while (n > 0) {
if (n & 1) res ... | 1,328 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define ios \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
... | 760 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int N;
long long dp[2002][2002];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
vector<pair<long long int, int>> v(N);
for (int i = 0; i < N; i++) cin >> v[i].first, v[i].second = i + 1;
sort(v.begin(), v.end());
reve... | 326 |
Project_CodeNet | 2,020 | //#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
//#include <queue>
//#include <stack>
#include <cstring>
#include <cassert>
using namespace std;
#ifdef LOCAL_DEBUG
#include <local_debug.h>
#define DEBUG(x...) cerr << __LINE__ << ": " << #x... | 444 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using P = pair<ll,int>;
template <class T> void chmin(T &a, const T &b) noexcept { if (b < a) a = b; }
template <class T> void chmax(T &a, const T &b) noexcept { if (a ... | 466 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = s; i < n; ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define tmax(a,b,c) max(a,max(b,c))
#define tmin(a,b,c) min(a,min(b,c))
#define pb pu... | 597 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <iostream>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define rREP(i,m,n) for(ll i... | 738 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
template<typename T>void read(T&x){x=0;int fl=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')
fl=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}x*=fl;}
template<typename T,typename...Args>inline void read(T&t,Args&...args){read(t);read(... | 396 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
using namespace std;
int N;
pair<long,int>A[2000];
long dp[2001][2001];
main()
{
cin>>N;
for(int i=0;i<N;i++)
{
cin>>A[i].first;
A[i].second=i;
}
sort(A,A+N);
reverse(A,A+N);
for(int i=0;i<N;i++)
{
for(int j=0;j<=i;j++)
{
int k=N-(i-j);
dp[j+1][k]=max(dp[j+1]... | 214 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template<class T>
void chmax (T &a, const T &b) {
if (a < b) a = b;
}
int main() {
int n;
cin >> n;
vector<pair<long long, int>> a;
for (int i = 0; i < n; i++) {
long long e;
cin >> e;
a.emplace_back(e, i);
}
sort(a... | 300 |
Project_CodeNet | 2,020 | //
// S i r o t a n w a t c h e s o v e r y o u .
//
// ...Jggg+J+JJJg@NQmgJa.....,
// ....gH@@@@HHB""""7"YYYYHMMMMMMM@@@@@@@Hma,.
// ...JH@@MMHY"! ? _... | 2,659 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 2e3 + 7;
int dp[MAXN][MAXN];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; ++i)
{
cin >> a[i].first;
... | 321 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#include <map>
#include <... | 511 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace boost::multiprecision;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){cout << (v[i]) << " ";} cout << ... | 2,017 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define per(i,n) for (int i=n-1; i>=0; --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vv = vector<vi>;
const int mod = 10000... | 363 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
constexpr ll INF = 1145141919810364364;
void chmax(ll &x, ll y) { x = max(x, y); }
int main() {
int n;
cin >> n;
vector<pair<ll, int>> v(n);
for (int i = 0; i < n; i++) {
ll a;
cin >... | 316 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
... | 916 |
Project_CodeNet | 2,020 | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define deb... | 811 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof a) ;
#define vi vector<int>
#define vit vector<int> :: iterator
#define all(ans) ans.begin(),ans.end()
#define sz(a) int(a.size())
#define ub upper_bound
#define lb lower_bound
#define create(Name,N,M,val) vector<vector<int> > Name(N,vecto... | 4,329 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
template<typename T1,typename T2> inline void chmin(T1 &a, T2 b){ if(a > b) a = b; }
template<typename T1,typename T2> inline void chmax(T1 &a, T2 b){ if(a < b) a = b; }
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(na... | 537 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.