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;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(a) setprecision(a)<<fixed
#define ss second
#define fori(v) for(ll i=0; i<v; i++)
#define forj(v) for(ll j=0; j<v; j++)
#define fork(v) for(ll k=0; k<v; k++)
#define forl(v) for(ll l=0; l<v; l++)
#define fort(v) f... | 568 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n; scanf("%d", &n);
vector<ll> arr(n);
for (int i = 0; i < n; ++i) scanf("%lld", &arr[i]);
vector<ll> sortValues(n);
for (int i = 0; i < n; ++i) sortValues[i] = i;
sort(begin(sortValues), end(sortValues), [&arr] (int i, int j) ... | 358 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <bitset>
using namespace std;
... | 426 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PDD;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define dbl(k, x) fixed << setprecision(k) << (x)
t... | 544 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define mkp make_pair
#define fi first
#define se second
void read(int &x){
scanf("%d",&x);
}
void write(ll x){
if (x>9) write(x/10);
putchar(x%10+'0');
}
int n;
pii a[2003];
bool cmp(pii A,pii B){return A.fi>B.fi;}
ll dp... | 291 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 2005;
int n, a[MAX_N], order[MAX_N];
ll dp[MAX_N][MAX_N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
iota(order + 1, order + n + 1, 1);
sort(order + 1... | 321 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include<limits.h>
#include<stdio.h>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
#define fi first
#def... | 1,068 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define ld long double
#define showoff ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define RFOR(i,a,b) f... | 509 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using boost::multiprecision::cpp_int;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
const ll INF = LLONG_MAX;
const ll MOD = 1e9+7;
int main() {
// input, ready
int N;
cin >> N;
vec... | 370 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define fast ios:: sync_with_stdio(false),cin.tie(nullptr);
const int N = 2005;
int dp[N][N];
int n;
vector<pair<int,int>>a;
int solve(int l , int r){
if(l > r) return 0;
int &res = dp[l][r];
if(res != -1) r... | 260 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<... | 941 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long N;
cin >> N;
vector<pair<long long, int>> A(N+1);
A.at(0).first = 0;
for (long long i = 1; i < N+1; i++){
A.at(i).second= i;
cin >> A.at(i).first;
}
sort(A.begin() + 1, A.end(), greater<pair<long long, in... | 380 |
Project_CodeNet | 2,020 | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 564 |
Project_CodeNet | 2,020 | // 2020-07-18 04:28:33
#include<bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i... | 561 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | 531 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[2234][2234];//dp[i][j]:i+1番目で左がj埋まってる
const long long LINF=1e18;
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
typedef pair<int,int> P;
#define fi first
#define se second
signed main(){
int n;cin>>n;
vector<P> v(n);
for(int ... | 281 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | 982 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define r... | 449 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#d... | 438 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
v... | 366 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long int
void fileioe(){
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt","w",stderr);
}
#define GO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
#define fioe() fileioe()
#else
#define ... | 333 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n,dp[2005][2005];
struct node
{
int rt;
int num;
}a[5005];
bool cmp(node a,node b)
{
return a.num>b.num;
}
int work(int now,int l,int r)
{
if (l>r) return a[now].num;
if (dp[l][r]!=-1) return dp[l][r];
int first=work(now+1,l+1,r)+a[no... | 238 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<limits>
#define ll long long
#define F first
#define S second
#define pb push_back
#define oo (1LL<<63-1)
#define endl '\n'
#define si size()
#define all(v) v.begin(),v.end()
#define FASTIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define Matrix vector< vector < long long > ... | 345 |
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()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
... | 360 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#define mm(a,x) memset(a,x,sizeof(a))
#define sync std::ios::sync_with_stdio(false);std::cin.tie(0)
#define ll long long
using namespace std;
struct A{
int id;
ll a;
bool operator<(const A &o)const{
return a>o.a;
}
}a[2010]... | 312 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
const int maxN = 2e3 + 10;
const ll inf = 1e18;
int n;
pair<ll, int> a[maxN];
ll dp[maxN][maxN];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen("abc.inp", "r", stdin); freopen("abc.ou... | 400 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <functional>
#include <climits>
#include <cstring>
using namespace std;
#define int long long
#define rep(i, n) for (int i=0;i<(int)n;++i)
#define r... | 463 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).b... | 456 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define ff first
#define ss second
#defin... | 348 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
////////////////////////////// Begin Macros
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; ... | 1,723 |
Project_CodeNet | 2,020 | /*{{{*/
#include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) s... | 1,015 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
typedef long long ll;
const ll longinf=1LL<<60;
using namespace std;
int n;
struct node
{
ll v;
int index;
};
node a[3000];
ll f[2100][2100];... | 348 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
const int N = 2e3+5;
ll n , dp[N][N];
pair<ll,ll> a[N];
ll solve(int l , int r)
{
if (l > r) return 0;
if (dp[l][r] != -1)
return dp[l][r];
ll ans , idx = n-r+l;
a... | 276 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <algorithm>
#include <vector>
int x[2010];
long long int y[2010];
int a;
struct str{
int first;
int second;
};
bool operator<(str a, str b)
{
if(a.first==b.first) return a.second<b.second;
return a.first<b.first;
}
std::vector<str> V;
long long int check[2010][2010];
long long int func(... | 286 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const int INF = (1 << 29);
int main()
{
int N;
cin >> N;
vector<pair<ll, int>> A(N);
rep(i, N)
{
ll a;
cin >> a;
A.at(i) = make_pair(a, i);
}
sort(A.begin(), A.end());
reverse(A... | 307 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int max_n = 2005;
ll dp[max_n][max_n];
inline void chmax(ll& a, ll b){
a = max(a, b);
}
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
for(int i=0; i<n+1; i++){
for(... | 326 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e3+5;
vector<pair<ll,ll> >v(N);
ll dp[N][N];
int n;
ll fun(int l,int r){
if(l>r) return 0;
if(dp[l][r]) return dp[l][r];
int i=n-(r-l+1);
return dp[l][r]=max(fun(l,r-1)+v[i].first*(r-v[i].second),fun(l+1,r)+v[i].first*(v[i].second-l));
... | 188 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define MOD 1000000007LL
#define N 2123
using namespace std;
int n;
ll dp[N][N], ans;
struct child {
ll value;
int idx;
} children[N];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for(int i=1; i <= n; ++i) {
cin >>... | 310 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#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 all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | 640 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define vcout(v) rep(i,v.size()) cout << v[i] << " "; cout << endl
#define mcout(m) rep(j,m.size()){vcout(m[j]);}
const ll MOD = 1e9 + 7;
int mainsolve(){
ll n;
cin >> n;
vector... | 318 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define inf 0x7fffffff
#define clr(c) memset(c,0,sizeof(c))
using namespace std;
int mod=1e9+7;
const int M=1e6+10;
const int N=2e3+10;
inline ll read(){
ll b=1,sum=0; char c=getchar();
while(!isdigit(c)){if(c=='-') b=-1; c=getchar();}
while(isdigit(c)){sum=sum*... | 401 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int maxn=2e3+5;
typedef long long ll;
ll dp[maxn][maxn];
int n;
pair<int,int> a[maxn];
inline bool cmp1(pair<int,int> a1,pair<int,int> b1){
return a1.first>b1.first;
}
int main(){... | 318 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
using namespace std;
template <class T> inline void chmax(T &x, const T &y) {if (x < y) x = y;}
typedef pair<int, int> P;
int n;
P p[2000];
long long dp[2020][2020];
int main()
{
cin >> n;
for (int i = 0; i < n; i++) {
int a;
... | 257 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rp(i,n) for(int i=0; i<n; i++)
using namespace std;
using ll=long long;
using P=pair<int,int>;
using G=vector<vector<int>>;
ll dp[2003][2003];
int main(){
int n;
cin >> n;
vector<P> vp;
dp[0][0]=0ll;
rp(i,n){
int a;
cin >> a;
vp.push_back... | 349 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cmath>
#include <utility>
#include <algorithm>
#include <cstring>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
typedef pair<ll,ll> pll;
#define mp make_pair
#define x first
#define y second
pll sor[2003];
ll arr[2003],dp[2003][2003];
ll rek(int x,int y){
if(x>... | 248 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... | 974 |
Project_CodeNet | 2,020 | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | 545 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits.h>
#include <climits>
#include <map>
#include <unordered_map>
#include <cmath>
#include <set>
#include <unordered_set>
#include <iterator>
#include <deque>
#include <assert.h>
using namespace std;
typedef unsig... | 566 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#define inf 0x3f3f3f3f
#define pi 3.1415926535898... | 347 |
Project_CodeNet | 2,020 | // Copyright © 2020 Diego Garcia Rodriguez del Campo. All rights reserved.
#include<bits/stdc++.h>
#define MAX 2005
#define pii pair < ll , ll >
#define fi first
#define se second
#define optimiza_io cin.tie(0); ios_base::sync_with_stdio(0);
#define forn(i,a,b) for (ll i = a; i <= b; i ++ )
#define mod(n,k) (((n%k)+k)... | 377 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
//typedef __int64 LL;
typedef long long int LL;
typedef pair<int,int> P;
typedef pair<LL,LL> PL;
cons... | 326 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
const ll SIZE = 1e5... | 450 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct Node
{
ll v;
ll weizhi;
};
Node a[5005];
bool cmp(Node a,Node b)
{
if(a.v>b.v)return true;
else if(a.v==b.v&&a.weizhi<b.weizhi)return true;
else return false;
}
ll dp[5005][5005];
long long ans;
ll zuo;
ll you;
ll max(ll a,ll b)
{
if(a>b)re... | 339 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a, id;
vector<vector<long long>> dp;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < n; ++i) id.push_back(i);
sort(id.begin(), id.end(), [&](int l, int r) {
i... | 384 |
Project_CodeNet | 2,020 | /**
* author: rishabh_sethi
**/
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i,n) for(i = 0; i < n; i++)
#define f1(i,n) for(i = 1; i <= n; i++)
#define all(a) a.begin(),a.end()
#define upp(v,val) upper_bound(v.begin... | 2,013 |
Project_CodeNet | 2,020 | //
// main.cpp
// E
//
// Created by 曾憲揚 on 2020/8/19.
// Copyright © 2020 曾憲揚. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e3+5;
pair<int,int> a[maxn];
ll dp[maxn][maxn];
ll solve_dp(int i, int j, int n){
if(dp[i][j] != -1) return dp[i][j];
... | 304 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
... | 973 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define ... | 1,293 |
Project_CodeNet | 2,020 | #include<iostream>
#include<math.h>
#define ll long long
using namespace std;
ll dp[2001][2001]={};
int main(){
int N;
cin >> N;
ll a[N];
int index[N];
for(int i=0;i<N;i++){
cin >> a[i];
index[i]=i;
}
/* sort with index*/
for(int i=0;i<N;i++){
for(int j=0; j<N-i-1;j++){
if(a[j]<a... | 468 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long N;
pair<long long, int> A[1 << 18];
long long dp[2009][2009];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i].first;
A[i].second = i + 1;
}
sort(A, A + N);
for (int i = N - 1; i >= 0; i--) {
for (int... | 278 |
Project_CodeNet | 2,020 | # include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
int n;
long long dp[N][N];
pair <int, int> a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i].first;
a[i].second = i;
}
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i... | 310 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <unordered_map>
#include <unordered_s... | 471 |
Project_CodeNet | 2,020 | #include <vector>
#include <iostream>
#include <algorithm>
#define ff first
#define ss second
using namespace std;
struct _ { ios_base::Init i; _() { ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL); } } _;
int main() {
int n; cin >> n;
vector<pair<long long , long long >> a(n);
for (int i = 0; i ... | 398 |
Project_CodeNet | 2,020 | // #pragma GCC optimize("O3", "unroll-loops")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long int ll;
#define endl '\n'
#define ld long double
#define all(a) a.beg... | 516 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M1 1000000007
#define M2 998244353
#define ll long long int
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define F first
#define S ... | 845 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef tuple<ll, ll, ll> ti;
ll mod=1E9+7;
#define REP(a,b,c) for(ll a=(b);a<(c);a++)
#define PER(a,b,c) for(ll a=(b);a>=(c);a--)
ll ii(){ ll x; cin >> x; return x;... | 402 |
Project_CodeNet | 2,020 | /***************************************************
* Problem Name : E.cpp
* Problem Link : https://atcoder.jp/contests/abc163/tasks/abc163_e
* OJ : atCoder
* Verdict : Trying
* Date : 2020-04-19
* Problem Type :
* Author Name : Saikat Sharma
* University : CSE, MBSTU
***************... | 1,023 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define fastio ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(10);
#define f first
#define s second
#define endl "\n"
#define pb ... | 454 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
typedef pair<int, int> pi;
int n;
pi a[maxn];
typedef long long ll;
ll dp[2005][2005];
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i].fi... | 330 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n",(x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define isYes(x) printf("%s\n",(x) ? "Yes" : "No")
#define isIn(x,y,h,... | 558 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long f[2001][2001][2];//f[i][j][0/1]表示排到第i大的点
//左边累计j个点,往最左/右边放的ans
int n;
struct node{
long long w;
int id;
}a[2001];
inline bool mycmp(node x,node y){
return x.w>y.w;
}
int main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
cin>>n;
for(int i=1;i<... | 419 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define en "\n"
#define INF (int) 9e18
#define HELL (int) (1e9 + 7)
#define int long long
#define double long double
#define uint unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fs first
#define sc second
#define size(a) (int) a.size()
#define de... | 580 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | 1,084 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<unordered_map>
#include<stack>
#include<string>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<cstring>
#include<utility>
#include<math.h>
using namespace std;
/**** Type Define ****/
typedef long long l... | 2,214 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define mp make_pair
#define endl "\n"
#define pii pair<int,int>
#define ff first
#define ss second
#define mii map<int,int>
#define si set<int>
#define sti stack<int>
#define qi queue<int>
#define vi vector<int>
#define pq priorit... | 398 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include ... | 579 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double>... | 420 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#
using namespace std;
#define ll long long
int n;
ll a[2005];
ll f[2005][2005];
int idx[2005];
ll absolute(ll val)
{
return val < 0LL ? -val : v... | 355 |
Project_CodeNet | 2,020 | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
// #include <prettyprint.hpp>
using namespace std;
typedef long long ll;
static const ll max_h = 12;
static const ll max_w = 1010;
static const ll max_val... | 574 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll N;
vector<P> A; //(活性度、番号)
vector<vector<ll>> dp(2010, vector<ll>(2010, 0));
ll res = 0;
int main(){
cin >> N;
ll a;
for(ll i = 1; i <= N; i++){ cin >> a; A.push_back({a, i}); }
sort(A.begin(), A.end());
reverse... | 313 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long n,ans,dp[2020][2020];
pair<long long,long long>p[2020];
bool cmp(pair<long long,long long>a,pair<long long,long long>b)
{
if(a.first!=b.first)
{
return a.first>b.first;
}
return a.second<b.second;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
long long ... | 286 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | 352 |
Project_CodeNet | 2,020 | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <iterator>
#include <numeric>
#include <cstdint>
#include <cmath>
#include <bitset>
#include <string>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define N... | 482 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e3+7;
ll dp[N][N];
struct stu{
ll value,id;
bool friend operator<(const stu &x,const stu &y){
return x.value>y.value;
}
}arr[N];
int main(){
ll n;
cin>>n;
for(ll i=1;i<=n;i++) {
cin>>arr[i].value;
arr[i].id=i;
}
sort(arr+1,arr... | 253 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using llong = long long int;
#define rep(i, n) for (int i = 0; i < ((int)n); ++i)
#define stl_rep(itr, x) for (auto itr = x.begin(); itr != x.end(); ++itr)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
const static int MOD = 1000000007;
const sta... | 1,538 |
Project_CodeNet | 2,020 | //#include<bits\stdc++.h>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<queue>
#include<deque>
#include<stack>
#include<vector>
#include<algorithm>
#include<utility>
#include<bitset>
#include<set>
#inc... | 634 |
Project_CodeNet | 2,020 | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
t... | 619 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | 523 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l) ; i < (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l) ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r) ; i >= (l); --i)
#define inc(... | 823 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define um unordered_map
#define F first
#define S second
#define MOD 1000000007
#define TC int t; cin >> t; while(t--)
#define FAST ios_ba... | 476 |
Project_CodeNet | 2,020 | #include <iostream>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const ll INF = 1e18;
const int MX = 2020;
ll dp[MX][MX];
inline void chmax(ll &a, ll b)
{
a = max(a, b);... | 380 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int main(){
int64_t N;
cin >> N;
vector<pair<int64_t,int64_t>> A(N);
for ( int64_t i = 0; i < N; ++i){
int64_t A_sub;
cin >> A_sub;
A[i] = make_pair(A_sub,i);
//cin >> A.at(i).... | 761 |
Project_CodeNet | 2,020 | #include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
const int N = 2005;
int a[N],d[N];
ll f[N][N];
bool cmp(int x,int y)
{
return a[x] > a[y];
}
int main()
{
int n;sca... | 300 |
Project_CodeNet | 2,020 | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i =... | 1,400 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a<b)?a:b)
#define max(a, b) ((a<b)?b:a)
#define pb push_back
#define endl "\n"
typedef long long ll;
#define max_element mmmmm
#define min_element nnnnn
#define int long long
template<class T>
class BIT {
public:
int BIT_size;
vector<T> BIT_array... | 761 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cstring>
#include <cmath>
typedef long long ll;
using namespace std;
const int maxn = 2009,MOD = 1e9+7;
const double pi = acos(-1.0);
ll n,a[maxn],f[maxn][maxn],id[maxn],ans;
bool cmp(ll x,ll y){
return a[x] > a[y];
}
int main(){... | 329 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x,y) CPP_CAT_I(x,y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x,y) x ## y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = in... | 816 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bo... | 859 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define pb push_back
#define mp make_p... | 660 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | 440 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.