Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Ido Kessler
*/
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <unordered_set>
#includ... | 3,236 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
vector<pair<unsigned long, unsigned long>> A;
for(unsigned long i{0}, a; i < N; ++i){
cin >> a;
A.emplace_back(a, i);
}
sort(A.begin(), A.end(), greater<>());
vector<unsigned long> dp(N +... | 254 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#in... | 2,511 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
// definitions
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define rep(i, l, r) for (long long i = (l); i < (long long)(r); i++)
#define repb(i, r, l) for (long long i = (r); i > (long long)(l); i--)
#define pb push_back
#define mod... | 1,304 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp = ... | 597 |
Project_CodeNet | 2,020 | //
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define f first
#define s second
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int MOD = 1000000007;
const int INF = 1000000007;
ll dp[2002][2002];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
... | 340 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn=2010;
int n;
struct da{int v,id;}q[maxn];
long long dp[maxn][maxn];
inline bool cmp(da aa,da bb){return aa.v>bb.v;}
long long dfs(int l,int r)
{
if (dp[l][r]!=-1) return... | 247 |
Project_CodeNet | 2,020 | // Sakhiya07 - Yagnik Sakhiya
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define mp make_pair
#define bp __builtin_popcountll
#define MOD 1000000007
const int N = 2005;
#def... | 373 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vi2;
typedef vector<vi2> vi3;
typedef p... | 478 |
Project_CodeNet | 2,020 | /*
* zyrch - Rupanshu Yadav
*/
#ifdef CREED
#include "creed.h"
#else
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functio... | 1,260 |
Project_CodeNet | 2,020 | /*
Uruchamiamy samolot zwiadowczy ( + 500% do wzlamaniej )
/▄/ /█/ /◐/ /▐/ /▌/ /▀/ /░/ / / choose your own style!
***IT'S OUR LONG WAY TO THE OIILLLL***
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░... | 2,157 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const long long mod = 1e9+7;
long long power(long long a, long long b, long long m = mod) {
if(b < 0) {
return power(power(a, -b), mod-2);
}
long long x = 1;
while(b) {
if(b & 1) {
x = 1ll * x * a % m;
... | 450 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | 479 |
Project_CodeNet | 2,020 | // ABEY SAALE
// QUESTION KHUD KR SOLUTION KYU DEKH RHA H
//MAAF KIJIYEGA ME GUSSE ME IDHAR UDHAR NIKAL JATA HU
#include<bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define endl "\n"
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#de... | 601 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | 464 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include... | 2,741 |
Project_CodeNet | 2,020 | /*input
*/
#include <bits/stdc++.h>
#define up(i,a,b) for(int (i) = (a);(i)<=(b);++(i))
#define down(i,b,a) for(int (i) = (b);i>=(a);--i)
#define debug(x) cerr << (x) << '\n';
#define bits(x,i) ((x >> i) & 1)
#define mid ((l+r)/2)
#define pr pair<int,int>
using namespace std;
const int N = 2005;
pair<int,int> a[N];
lo... | 354 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = int64_t; using ull = uint64_t; const ll INF = 9e18;
void print() { cout << endl; }
template<typename Head,typename... Tail> void print(Head head,Tail... tail){cout<<head;if(sizeof...(Tail)>0)cout<<" ";print(tail...);}
void print0() {}
template... | 495 |
Project_CodeNet | 2,020 | //69行目から編集
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <set>... | 696 |
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 = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | 455 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
voi... | 728 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[2005][2005];
int main() {
int n;
cin >> n;
vector< pair< ll , ll > > a(n + 1);
for(int i = 1 ; i <= n ; i++){
int x;
cin >> x;
a[i] = {x , i};
}
for(int i = 0 ; i <= n ; i++){
for(int j = 0 ; j <= n ; j++)
dp[i][j] = -1;
}
dp[0... | 355 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll dp[2004][2004];
struct node{
ll id,act;
}a[2004];
bool cmp(node a,node b){
if(a.act!=b.act)return a.act>b.act;
else return a.id<b.id;
}
int main(){
ll n;
scanf("%lld",&n);
for(ll i=0;i<n;i++){
scanf("%lld",&a[i].act);
a[i].id=i;
}
sort(a,a+... | 342 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
using namespace std;
int main() {
ll n;
cin>>n;
vector<pair<ll,ll>> a(n);
rep(i,n){
ll aa;
... | 347 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
using namespace std;
long long t[2001][2001] = {};
int main()
{
cin.sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
vector<pair<long long, int>> v(n);
for(int i = 0; i < n; i++)
{
... | 310 |
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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL);
#de... | 2,465 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#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 repr(i, a, b) for (int i = a; i >= (b); --i)
#defi... | 715 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i,n) for (ll i = 0; i < (n); ++i)
#define RREP(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define ALL(v) (v).begin(), (v).end()
vector<pair<ll, ll>> a;
struct HashPair {
template<class T1, class T2>
si... | 457 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) fo... | 621 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <array>
#include <tuple>
#include <string>
#include <algorithm>
#include <functional> // greater など
#include <cmath> // abs など
#include <numeric> // accumulate, gcd など
#include <cassert> // assert... | 718 |
Project_CodeNet | 2,020 | // <head>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1002003004;
const ll LINF = 1002003004005006007ll;
struct preprocess{preprocess()
{cin.tie(nullptr);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}}____;
// </head>
// <library>
//... | 382 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
int n;
ll a[2005];
P p[2005];
ll dp[2][2005];
int main(void){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%lld",&a[i]);
p[i]=P(a[i],i);
}
sort(p,p+n);
reverse(p,p+n);
memset(dp,-1,sizeof(dp)... | 315 |
Project_CodeNet | 2,020 | #include<iostream>
#include<iomanip>
#include<cassert>
#include<math.h>
#include<complex>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<unordered_map>
#include<functional>
#include<vector>
using namespace std;
typedef long long ll;
typedef... | 348 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
void chmax(ll& a, ll b) { a = max(a, b... | 401 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h> // clang-format off
using Int = long long;
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout <... | 561 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<cmath>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define vi vector<ll>
#define vvi vector<vi>
#define pii pair<ll, ll>
#define vii vector<pii>
#define pb push_back
#define B begin()
#define E end()
#defin... | 465 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int n;
long long num[2005], loc[2005];
long long dp[2005][2005] = {0};
struct node {
long long a, id;
} input[2005];
bool comp (node xx, node yy) {
return xx.a > yy.a;
}
int main () {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> input[i].a;
input[i].id = (lon... | 405 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
typedef vector<int> vi;
const int INF = 1LL << 60; //10e18+10e17ちょっとくらい
const int MOD = 1000000007;
const int MAX_N = 200100;
int dp[2020][2020];
... | 390 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define i64 long long int
#define ran 2022
int n;
pair<int, int> a[ran];
i64 f[ran][ran];
int cmp_desc(pair<int, int> &a, pair<int, int> &b) {
return a>b;
}
i64 mv(int v, int fr, int to) {
return 1LL*v*labs(fr - to);
}
void upd(i64 &a, i64 b) {
a = max(a, b);
}
int ... | 349 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N, A;
cin >> N;
vector<pair<ll, int>> Ai(N), Bi(N);
rep(i, N) {
cin >> A;
Ai[i] = make_pair(A, i);
}
sort(Ai.begin(), Ai.end());
vector<vector<l... | 428 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
con... | 381 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int M=2005;
LL dp[M][M];
vector<PII> vec;
int main()
{
int n;
scanf("%d",&n);
int ai;
for(int i=0;i<n;i++)
{
scanf("%d",&ai);
vec.push_back({ai,i});
}
sort(vec.begin(),vec.end());
for(int i=0;i<n;i++)
d... | 233 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1145141919810893364
//#define INF 810114514
#define PI 3.141592653589
typedef pair<int,int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define ORE... | 518 |
Project_CodeNet | 2,020 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define c(P) cout<<P<<"\n"
#define pii pair<ll,ll>
#define mi map<ll,ll>
#define mii map<pii,ll>
#define F first
#define S second
#define sz(a) (ll)(a.size())
#define cr(P) ... | 404 |
Project_CodeNet | 2,020 | // May this submission get accepted
#include <bits/stdc++.h>
// エイリアス
using ll = long signed long;
using ull = long unsigned long;
using ld = long double;
using namespace std;
// AtCoder/Codeforces 用 デバッグ検知
#ifdef ONLINE_JUDGE
constexpr bool DEBUG_MODE = false;
#else
constexpr bool DEBUG_MODE = true;
#endif
// エイリ... | 1,540 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
//g++ -g -o yourexe yourfile.cpp
//./yourexe < yourinput.in > youroutput.out
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define M 1000000007
#define ll long long
#define ld long double
#define vi vector<ll>
#define pi pair<ll, ll>
#def... | 446 |
Project_CodeNet | 2,020 | //#pragma GCC optimization ("O3")
//#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define ok puts("ok")
#define ll long long
#define pb push_back
#... | 393 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n = vec.size();
rep(i,n) c... | 460 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<math.h>
#include<string.h>
#include<string>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<iostream>
#include<algorithm>
#include<unordered_map>
#include<unordered_set>
#define PI acos(-1)
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF 0x3f3f3f3f
#defi... | 366 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) _back
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
con... | 333 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
#define dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << endl; \
}
#de... | 1,008 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_sin... | 443 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > a(2010);
long dp[2010][2010];
template<class T> inline bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main(){
int n, x;
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%d", &x);
a.push_back(... | 282 |
Project_CodeNet | 2,020 | // https://atcoder.jp/contests/abc163/tasks/abc163_e
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for(int i=(b); i<=(int)(e); i++)
#define DEBUG 0
#if DEBUG
#define DUMP(a) REP(_i, a.size()) cout << a[_i]... | 585 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<pair<int,int>> A;
ll memo[2000][2000];
bool visited[2000][2000];
ll f(int p, int q) {
if (p == N) return 0;
if (visited[p][q]) return memo[p][q];
visited[p][q] = true;
ll Ax = A[p].first;
int x = A[p].second;
ll r1 = f(p+1, q+1) + A... | 230 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using f64 = double;
using p64 = pair<i64, i64>;
void solve() {
i64 n;
cin >> n;
vector<p64> a(n);
for (i64 i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
}
sort(begin(a), end(a), greater());
v... | 320 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL),cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector... | 468 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector< pair<ll,int> > a(n);
rep(i,n) {cin >> a[i].first; a[i].second = i;}
sort(a.... | 284 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vi = vector<int>;
using vll = vector<l... | 857 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
typedef pair<int,int>pii;
typedef long long ll;
const int N = 2000;
ll dp[N+10][N+10];
pii a[N+10];
ll solve(int l,int r,int pos)
{
//printf("%d %d %d\n",l,r,pos);
if(r-l==1){
return 0;
}
if(dp[l][r]!=0){
return dp[l][r];
}
ll t1 = 1ll*a[pos... | 270 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <bitset>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
int main(){
int N;
cin >> N;
vector<pair<ll,int>> A(N,make_pair(0,0));
f... | 399 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<int,int>>A(N);
for(int i=0;i<N;i++){
int a;
cin>>a;
A[i]={a,i};
}
sort(A.rbegin(),A.rend());
vector<vector<long>>dp(2020,vector<long>(2020,-(1L<<60)));
dp.at(0).at(0)=0;
for(int i=0;i<N;i++){// i:詰める個数-1
... | 414 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); 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 equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | 586 |
Project_CodeNet | 2,020 |
//region Template
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
template<typename T> void debug_out(string name, T arg) { cerr<<name<<"="<<arg<<endl; }
template<typename T1, typename... T2> void debug_out(string name, T1 arg, T2... args) {
cerr<<name.substr(0, name.find(','))<<"="<<arg<<", ";
debu... | 778 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
... | 297 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<class T> inline bool chmin(T&x,T y){if(x>y){x=y;return true;}return false;}
template<class T> inline bool chmax(T&x,T y){if(x<y){x=y;return true;}return false;}
#define fr(i,n) for(int i=0;i<(n);++i)
#define Fr(i,n) for(int i=1;i<=(n);++i)
#defin... | 350 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, s, t) for (int i ... | 1,384 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <random>
#include <chrono>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cstdlib>
... | 899 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s; i<(n); ++i)
#define ALL(n) begin(n),end(n)
using ll = long long;
const ll INF = 1e18;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chm... | 525 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
//#include<tr1/unordered_map>
#pragma GCC optimize ("Ofast")
#define ll long long
#define pll pair<long long,long long>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i, n) for(int i=0; i<int(n); i++)
#define Forn(i, n) for(int i... | 411 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
//#define rep(i, n) for (ll i = 0; i < (n); ++i)
//typedef pair<ll, ll> P;
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x... | 778 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define ff first
#define ss second
#define pb push_back
#define sz size()
#define mp make_pair
const int N = 2005;
const int MOD = 1e9 + 7;
pair<int, int> A[N];
ll dp[N][N];
int n;
ll call(int i, int L){
if(i == n) r... | 308 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
vector<pair<long long,long long>>p(n);
for(int i=0;i<n;i++){
cin>>a[i];
p[i]={a[i],i};
}
sort(p.begin(),p.end(),greater<pair<long long,long long>>());
vector<vector<long long>>dp(n+1,vector<... | 288 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using P = pair<int64_t,int64_t>;
int main() {
int N;
cin >> N;
vector<P> vec(N);
for(int i=0; i<N; i++){
int64_t x;
cin >> x;
P p = make_pair(x,i);
vec[i] = p;
}
int64_t dp[N][N+1]; //i番目までの数で右側にj個
int64_t MINF = -1e9;
for(int i=0; i<N;... | 445 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define PI 3.141592653589793238462643383279502884L
#define make_unique(vec) vec.resize(distance(vec.begin(),unique(vec.begin(),vec.end())))
#... | 994 |
Project_CodeNet | 2,020 | // #pragma GCC target ("avx")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define endl '\n'
#pragma region TEMPLATE
/* TYPE */
typedef... | 3,000 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>... | 576 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, std::vector<long long> A){
vector<pair<ll, int>> v;
for(int i = 0;i < N;i++){
v.push_back({A[i], i});
}
sort(v.begin(), v.end(), greater<pair<ll, int>>());
vector<vector<ll>> dp(N+1, vector<ll>(N+1)... | 359 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 711 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<pair<long long int, int>> a(n);
for(int i=0; i<n; i++){
cin >> a[i].first;
a[i].second = i;
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
vector<vector<long long int>> dp(n+1, ... | 356 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
... | 540 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define rep(i,n) f... | 322 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define modulo ll (1e9 + 7)
const long double PI = 3.141592653589793238L;
typedef long long ll;
typedef pair<int,int> pii;
void init(){
cin.tie(0);
cin.sync_with_stdio(0);
}
const int N = 2e3 + 9, M = 5e3 + 9, OO = 0x3f3f3f3f;
c... | 339 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
using pll = pair<ll, ll>;
int main()
{
ios::sync... | 318 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define sec second
#define fir first
#define mo 998244353
#define inf 1e18
#define rep(i, s, n) for (ll i = s; i < n; i = i + 1)
#define rrep(i,s,n) for(ll i=s;i>=n;i--)
#define adiii\ ... | 476 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod1 1000000007
#define ff first
#define ss second
#define INF INT_MAX
#define INFLL LLONG_MAX
typedef long long int ll;
// #define intLL unsigned long long int//used whe... | 591 |
Project_CodeNet | 2,020 | /*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector... | 884 |
Project_CodeNet | 2,020 | #include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (long long int i = 1, i##_len = (n); i <= i##_len; ... | 1,991 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define ALL(v) v.begin(),v.end()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cout<<v[i]<<" "
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<doub... | 772 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x7fffffff
#define INFL 0x7fffffffffffffffLL
vector<pair<ll,ll>> a(2000);
ll n;
ll dp[2000][2000];
ll calc(ll x, ll y) {
int idx = x + ((n-1) - y);
if (idx == n) return 0;
if (dp[x][y]!=0) return dp[x][y];
ll ... | 263 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define var(type, ...) \
type __VA_ARGS__; \
read(__VA_ARGS__);
#ifndef DB... | 862 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define G() Cr = getchar()
int Xr, Fr; char Cr;
inline int rd() {
Xr =0 , Fr = 1, G();
while(Cr < '0' || Cr > '9') {if(Cr == '-') Fr = -1; G();}
while(Cr >='0' && Cr <= '9') Xr = (Xr<<1) + (Xr<<3) + (Cr&15), G();
return X... | 329 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll a[2005];
ll dp[2005][2005];
int main() {
ci... | 442 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pll;
int main() {
int N; cin >> N;
vector<Pll> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first;
A[i].second = i;
}
sort(A.begin(), A.end(), greater<Pll>());
vector<vector<ll>> memo(N+... | 312 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using UL = unsigned long;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for(int i = 0; i < (n); i++)
struct Problem {
ULL dp[2001][2001] = {};
void Solve() {
LL N; cin >> N;
vector<pair<ULL, LL>> A(N);
rep(i, N) {... | 347 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) a.begin(),a.end()
class CommonIO {
public:
CommonIO() {
std::cin.tie(0);
std::ios... | 858 |
Project_CodeNet | 2,020 | // ABC163E.cpp :
#include <iostream>
#include <vector>
#include <algorithm> // sort
#include <numeric> // accumulate
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
using P = pair<ll, ll>;
int main()
{
ll n;
cin >> n;
vector<P>a(n);
rep(i, n) {
cin >> a[i].first;
a[i].... | 561 |
Project_CodeNet | 2,020 | /********************************
* AUTHOR: ARNAB SEN *
* NICK : arnab1729 *
* INSTITUTION: IIEST, SHIBPUR *
********************************/
#include<bits/stdc++.h>
using namespace std;
typedef string STR;
typedef long long LL;
typedef long... | 1,103 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n; cin >> n;
vector<pair<ll, ll>> 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,ll>>());
vector<vector<ll>> dp(n+1, vector<ll... | 253 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#includ... | 1,193 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.