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;
const int N = 3000 + 10;
int n;
struct Node {
int pos, val;
}a[N];
long long dp[N][N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int x; scanf("%d", &x);
a[i] = (Node){i, x};
}
sort(a + 1, a + 1 + n, [&](Node a, Node b)... | 347 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<map>
#define il inline
#define re register
#define fo(i,j,k) for(register int i=j;i<=k;i++)
#define do(i,j,k) for(register int i=j;i>=k;i--)
#define inf 0x7fffffff
typedef long long ll;
using namespace st... | 512 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#def... | 368 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define LLMAX (1ll << 60) - 1
#define INTMAX (1 << 30) - 1
#define MOD 1000000007
#define NMAX 1000*100+1
#define numberOfSetBits(S) __builtin_popcount(S) // __builtin_popcountl(S) __builtin_popcountll(S)
#define MSET(x,y) memset(x,y,sizeof(x))
#defin... | 587 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define ll long long
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) R... | 510 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e+3 + 5;
long long int a[N], isf[N], ans, dp[N][N];
vector<pair<long long int, int>> v;
int n;
long long int solve(int i, int j)
{
if (i == (int)v.size())
return 0;
if (dp[i][j] == -1)
{
int i1 = v[i].second;
int k = n - ... | 454 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define INF (1 << 29)
static const int MAX = 3000;
using namespace std;
int main(){
int n; cin >> n;
long dp[MAX][MAX];
vector<pair<int, int> > A;
for(in... | 408 |
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<ll,ll>;
const int INF = 1000000001;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main() {
int n;
cin >> n;
vector<P> a(n);
rep(i, n){... | 351 |
Project_CodeNet | 2,020 | /**
* author: nayakashutosh9
* [2020-09-22 19:29]
**/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
#define modd 9982... | 593 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <string>
#include <stdlib.h>
#include <fstream>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <iterator>
#include <iomanip>
using namespace std;
int main() {
long long n;... | 338 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#... | 919 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <algorithm>
#define LL long long
#define MX (2000 + 233)
#define chkmx(a ,b) (a = __max(a ,b))
LL __max(LL a ,LL b){return a > b ? a : b;}
LL __abs(LL a){return a > 0 ? a : -a;}
LL dp[MX][MX];
struct P{
LL id ,A;
bool operator <(const P &B)const{
return A > B.A;
}
}P[MX];
int main(){
... | 347 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> i_i;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define REP(i,n) reps(i,0,n)
#define ALL(v) v.begin(), v.end()
#define SZ(x) ((int)((x).size()))
const double PI = acos(-... | 607 |
Project_CodeNet | 2,020 | //
// Created by yamunaku on 2020/04/19.
//
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x... | 529 |
Project_CodeNet | 2,020 | #define _CRT_SECURE_NO_WARNINGS
#define REL
#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <iomanip>
#include <cstdio>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <string>
#include <set>... | 998 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N = 2003;
int n;
long long dp[N][N], fp;
pair<int, int> b[N];
long long a(int i) {
return b[i].first;
}
int o(int i) {
return b[i].second;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; ++i) {
cin >> b[i].first;
... | 381 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll solve(const vector<pair<ll, ll>> &va, vector<vector<ll>> &memo, int l = 0,
int r = 0) {
if (l + r == va.size()) {
return 0;
}
if (memo[l][r] < 0) {
auto [a, idx] = va[l + r];
ll n = st... | 296 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
ll N;
typede... | 652 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define Task "abc"
#define For(i, a, b) for(int i = (a), _b = (b); i <= b; ++i)
#define All(x) (x).begin(), (x).end()
#define mp make_pair
typedef long long ll;
const int maxn = 2e3 + 10;
const int inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
in... | 436 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().coun... | 411 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define ... | 354 |
Project_CodeNet | 2,020 | //皆さん、第9回シンデレラガール総選挙は、トップでオンリーワンを目指す城ヶ崎美嘉に
//そしてボイスアイドルオーディションは、プログラミングが趣味の才女大石泉に、ぜひ投票をお願いします！
//#城ヶ崎美嘉を009のシンデレラに
//#大石泉の必勝プログラム
#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio... | 587 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
#define ci(m) for(int i=0;i<m;i++)
#define cj(m) for(int j=0;j<m;j++)
#define ck(m) for(int k=0;k<m;k++)
#define gcd __gcd
#define endl "\n"
#define pb emplace_back
#define setbits(x) __builtin_popcountll(x)
#define zrobits... | 545 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <queue>
#include <math.h>
using namespace std;
typedef long long int ll;
ll dp[2020][2020];
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
vector<pair<ll,int>> v(n);
for(int i=0;i<n;... | 255 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#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(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | 385 |
Project_CodeNet | 2,020 | #include <iostream>
#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 <limits>
#include <climits>
#include <ctime>
... | 640 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e5 + 10;
const int INF = 0x3f3f3f3f;
int n;
ll dp[2020][2020];
typedef pair<ll, int>pii;
vector<pii>vc;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
ll a;
scanf("%lld", &a);
vc.push_back(pii(a, i));
}
vc.push_back... | 373 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#in... | 1,810 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define pi acos(-1)
#define ll long long
#define pii pair<ll,ll>
#define debug(a) cout<<a<<'\n'
#define maxn 2009 /// Still trying to be normal
#define MOD 1000000007
#define F first
#define S second
#define rep(i, a, b) for(ll i = a; i < (b); ++i)
#define per(i, b, a) for(ll i = b-1; i>=a ; i--... | 369 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
// __builtin_ctz : no of trailing zeros
#define int long long
#define pp pair<int,int>
#define mod 1000000007
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<"... | 557 |
Project_CodeNet | 2,020 | #pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define... | 1,987 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define maxn 100005
using namespace std;
typedef long long ll;
int main(){
#define TASK "ABC"
// freopen(TASK".inp", "r", stdin); freopen(TASK".out", "w", stdout);
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector < pair < int, int > > a(n);
for (int i = 0; i < n; ++i) {
... | 358 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
typedef long long LL;
const LL maxn=2e3+9;
LL n;
LL a[maxn],pos[maxn],f[maxn][maxn];
bool cmp(LL x,LL y){
return a[x]>a[y];
}
int main(){
scanf("%lld",&n);
for(LL i=1;i<=n;++i) scanf("%lld",a+i);
for(LL i=1;i<=n;++i) pos[i]=i;
std::sort(pos+1,pos+1+n,cmp);
f[0][0]=0;
for(LL i=1;i<=n;++i){... | 262 |
Project_CodeNet | 2,020 | #pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define re return
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define make_unique(x) sort(all(x)),x.resize(unique(all(x))-x.begin())
#define fi first
#define se second
#define ss second.second
#define sf ... | 587 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> P;
#define int long long
#define override_rep(i, l, r, mes, ...) mes
#define rep1(i, n) for (int i = 0; i < n; i++)
#define rep2(i, l, r) for (int i = l; i < r; i++)
#define rep(...) override_rep(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
templ... | 379 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
void solve(int tc) {
int n;
cin>>n;
vector<pair<ll, ll>> a(n);
for(int i=0; i<n; ++i) {
cin>>a[i].first;
a[i].second = i;
}
sort(all(a));
vector<vector<ll>> dp(n, vector<ll>(n,... | 326 |
Project_CodeNet | 2,020 | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <sstream>
#include <io... | 2,169 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b)... | 476 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define i... | 432 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
struct Child
{
long long A,place;
bool operator>(Child XYZ) const
{
return A>XYZ.A;
}
};
long long dp[2002][2002];
int main()
{
long long N;
cin>>N;
vector<Child> in(N);
for(long long i=0;i<N;i++)
{
cin>>in[i].A;
i... | 263 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 1000007
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 2010
using namespace std;
ll n,dp[N][N... | 311 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
int main() {
int N;
std::cin >> N;
std::vector<std::pair<long long, int>> v(N);
for (int i = 0; i < N; i++) {
long long A;
std::cin >> A;
v[i] = std::make_pair(A, i);
}
std::sort(v.begin(),... | 294 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i... | 1,618 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
#define int ll
#define pb push_back
#define pii pair<int,int>
#define... | 352 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define FOR(i, begin, end) for(ll i = (begin); i < (end); i++)
#define rep(i, n) FOR(i, 0, n)
using ll = long long;
using namespace std;
#define all(x) (x).begin(),(x).end()
using pll = pair<ll, ll>; using vi = vector<int>; using vl = vector<ll>;
void chmax(ll& a, ll b) { a = max(a, b); }
ll n... | 308 |
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;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
*/typedef long long ll;
typedef unsigned long long... | 826 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T... | 486 |
Project_CodeNet | 2,020 | //1. 絶対値を外したい
//2. 各赤ちゃんの向きを決め打つ（後ろ向きにハイハイできると考えて整合性を取る）
//3. 活発度が大きい赤ちゃんから順に、端っこから割り当てる貪欲
//4. 赤ちゃんの向きをRRRLLLLLのように決め打つのは最適とは限らない <- 向きの組み合わせが非自明
//5. 3.において活発度最大の赤ちゃんは, 左端か右端に割り当てられる
//6. つまり、活発度の大きい赤ちゃんから「→」or「←」に割り当てていけば、残った場所が区間になる
//7. 区間DPができますね。O(N^2)
#include <iostream>
#include <algorithm>
#include <function... | 557 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<ll,ll>;
ll solve() {
ll N ,a ;
cin >> N;
vector<pii> A(N);
for ( int i = 0; i < N; i++ ) {
cin >> a;
A[i] = pii(a,i);
}
sort(A.rbegin(), A.rend());
vector<vector<ll>> dp(N, vector<ll>(N));
... | 314 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i<n; ++i)
#define rep1(i, n) for (int i=1; i<=n; ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
constexpr ll... | 700 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
template<class T> void chmax(T& x, T y){if(x < y) x = y;}
int N;
ll A[2010];
ll dp[2010][2010];
vector<pll> as;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
for(int i = 0; i < N; i++){
... | 291 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | 575 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2005;
ll dp[N][N];
int n;
vector <pair <ll, ll>> a;
ll go(int l, int r, int idx) {
if(idx == n) return 0;
if(dp[l][r] != -1) return dp[l][r];
ll p = a[idx].first, q = a[idx].second;
ll LL = p * abs(q - l) + go(l + 1, r, idx +... | 255 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define ALL(c) (c).begin(), (c).end()
template <class T, class Compare>
vector<int> sort_index(const vector<T>& v, Compare comp) {
vector<int> index(v.size());... | 421 |
Project_CodeNet | 2,020 | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<int, int>
#define pll pair<ll, ... | 433 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n;
cin >> n;
vector<pair<ll, ll> > v(n+1);
for(ll i=1; i<=n; i++){
cin >> v[i].first;
v[i].second=i;
}
sort(v.begin()+1, v.end(), greater<pair<ll, ll> >());
ll dp[n+1][n+1];
memset(dp, (l... | 283 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
int const N = 2002;
pair<long long, int> a[N];
long long dp[N][N];
int n;
long long solve(int l, int r){
if (dp[l][r] != -1) return dp[l][r];
int pos = l + n - 1 - r;
if (l == r) return dp[l][r] = (a[pos].first * abs(a[pos].second - l));
... | 274 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
const int N=2e3+5;
typedef long long LL;
LL f[N][N];
//f[l][r] indicate for the top l+r largest points the maximum total happiness that the number of the points move to left is l
struct Node{
int a,x;
bool operator < (const Node &b)const{return a>b.a;}
}a[N];
int main(){
... | 275 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<n;i++)
//#define rep(i,a,b) for (int i=a;i<=b;i++)
//#define per(i,a,b) for (int i=a;i>=b;i--)
#define all(cont) cont.begin(), cont.end()
#define unique(a) sort(all(a)) , (a).erase(unique((a).begin(), (a).end()),(a).end())
#define rall(cont)... | 1,002 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int mod = 1e9+7;
const int inf = 2e18;
int n;
int a[2005];
int dp[2005][2005];
pair<int,int> p[2005];
int recfun(int l,int r)
{
if(l>r)return 0;
if(dp[... | 300 |
Project_CodeNet | 2,020 | // Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define add(x) accumulate(x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i=a; ... | 449 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define pfi(a) printf("%d",a);
#define pfl(a) printf("%lld",a);
#define pfin(a) printf("%d\n",a);
#define pfln(a) printf("%lld\n",a);
#define sfi(a) scanf("%d",&a);
#define sfl(a) scanf("%lld",&a);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define ll long lo... | 325 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | 1,019 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int MAXN = 2005;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch =... | 455 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<long long>> a(n, vector<long long>(2, 0));
for (int i=0; i<n; i++){
long long tmp;
cin >> tmp;
a[i] = {tmp, i+1};
}
stable_sort(a.begin(), a.end());
reverse(a.begin(), a.end());
... | 323 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) f... | 723 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
u... | 1,313 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
c... | 363 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
template<typename T>
vector<vector<T>> MakeVector2D(int d1, int d2, T default_value) {
return vector<vector<T>>(d1, vector<T>(d2, default_value));
}
template<class T> inline bool UpdateMin(T& a, T b) {
if (a > b) { a... | 451 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef... | 1,114 |
Project_CodeNet | 2,020 | #include <iostream>
#include <assert.h>
#include <stdlib.h>
#include <time.h>
#include <stdio.h>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <string.h>
#include <cmath>
#include <memory.h>
#include <algorithm>
#include <unordered_map>
#include <unordered_... | 372 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll dp[2010][2010];
struct X{
int pos;
ll num;
}a[2010];
bool cmp(const X& a,const X& b) {
return a.num>b.num;
}
ll dfs(int pos,int l,int r) {
// printf("%d %d %d\n",pos,l,r);
if(l>r) return 0;
if(dp[l][r]!=-1) return dp[l][r];
ll lnum=dfs(p... | 245 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define SPEED ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MOD 1000000000
signed main()
{
SPEED;
int n;
cin>>n;
int a[n],dp[n+1][n+1],ans=0;
memset(dp,0,sizeof(dp));
vector <pair <int,int> >... | 299 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
const int INF=1e9+5;
const int N=2e5+5;
const ll oo=1e18+5;
const ll mod=1e9+7;
ll dp[2005][2005];
void max_self(ll& a,ll b){
if(b>a) a=b;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
... | 326 |
Project_CodeNet | 2,020 | /*suri_kumkaran*/
#include <bits/stdc++.h>
using namespace std;
#define UB upper_bound
#define LB lower_bound
#define BS binary_search
#define MP make_pair
#define EB emplace_back
#define endl "\n"
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define F first
#define S second
#define ALL(a) (a)... | 392 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
const int MX = 2005;
typedef long long ll;
#define f first
#define s second
int N;
vector<pair<ll,int>> v; // happiness, position
ll dp[MX][MX];
ll solve_dp(int l, int r) {
if (r < l) return 0;
ll& res = dp[l][r];
if (res != -1) return res;
int pos = l+N-... | 277 |
Project_CodeNet | 2,020 | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-04-21 16:00:36
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | 889 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define ff first
#define ss second
#define vll vector<ll>
#define pii pair<ll,ll>
#define sz(v) (v).size()
#define srt(v) sort(v.begin(),v.end... | 407 |
Project_CodeNet | 2,020 | #include"bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
void Main() {
int N;
cin >> N;
vector<P> A(N);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = P(a, i + 1);
}
sort(A.rbegin(), A.rend());
long long ans = 0;
long long dp[N + 1][N + 1];
memset(dp, 0, sizeof(dp)... | 372 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
ll gcd(ll a, ll b)
{
int c = a % b;
while (c != 0)
{
a = b;
b = c;
c = a % b... | 3,273 |
Project_CodeNet | 2,020 | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = 1e18, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W, x, y, z;
long long max_value = INF, max_index = -1;... | 456 |
Project_CodeNet | 2,020 |
// E - Active Infants
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
pair<ll, int> A[2000]; // 活発度とindexのペア
ll dp[2001][2001]; // dp[l][r]: 左端にl人、右端にr人移動させたときのうれしさの合計の最大値
int main(){
int N;
cin >>... | 377 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define ssrep(i, s, t) fo... | 538 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 515 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#define reppl(i,n,m) for (long long i =... | 633 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define lb lower_bound
#define si(c) (int)... | 868 |
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;
... | 296 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#define int long long
using namespace std;
int n;
struct node{
int val;
int id;
bool operator<(node x)const{
return val>x.val;
}
}a[2010];
int dp[2010][2010];
signed main(){
cin>>n;
for(int i=1;i<=n;++i){
cin>>a[i].val;
a[i].id=i;
}
sort(a+1,a+n+1);
for(int i=0;i<n;... | 255 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL>PII;
const int N=2050;
int n;
LL dp[N][N];
PII p[N];
LL solve(int idx,int mi,int mx)
{
if(idx>n) return 0;
if(dp[idx][mi]!=-1) return dp[idx][mi];
LL op1=solve(idx+1,mi+1,mx)+(LL)p[idx].first*abs(p[idx].second-mi);
LL op2=sol... | 246 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
#include <queue>
#include <unordered_set>
#include <set>
#include <unordered_map>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
using namespace std;
#define sL(i) ... | 481 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N,Z=0;
cin>>N;
vector<pair<int64_t,int64_t>> p(N);
for (int64_t i=0;i<N;i++) {
int64_t a;
cin>>a;
p.at(i).first=a,p.at(i).second=i;
}
vector<vector<int64_t>> d(N+1,vector<int64_t>(N+1));
sort(p.begin(), p.end());
reverse(p.begin(), p.en... | 315 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
using P = pair<ll,int>;
const ll INF = 1e17;
int main(){
int n;
cin >> n;
P c[n];
rep(i,n) {
cin >> c[i].first;
c[i].second = i;
}
sort(c,c+n,greater<P>());
vector<vector<ll>> dp(n... | 262 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define lld long long double
#define pb push_back
#define mp make_pair
#define M 1000000007
using namespace std;
const int N = 2005;
ll n;
ll memo[N][N];
ll f(int i, int l, int r, pair<ll, ll>a[]) {
if (l > r) return 0;
ll &ans = memo[i][l];
if (ans != -1) return ans;
... | 334 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
using ll=long long;
const ll MOD=1000000007;
int main() {
int N;
cin>>N;
vector<ll> A(N);
vector<pair<int,int>> ord(N);
rep(i,N){cin>>A.at(i);ord.at(i).first=A.at... | 313 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <algorithm>
using namespace std;
int N; pair<int, int> P[2020];
long long D[2020][2020];
int main()
{
scanf ("%d", &N);
for (int i = 0; i < N; i++) scanf ("%d", &P[i].first), P[i].second = i;
sort(P, P + N);
reverse(P, P + N);
for (int i = 0; i < N; i++) for (int j = 0; i + j < N; j+... | 271 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void)
{
int N;
cin >> N;
vector<pair<int, int>> A(N);
vector<vector<ll>> dp(N+1, vector<ll>(N+1, 0ll));
for(int i=0;i<N;i++){
int a;
cin >> a;
A[i] = make_pair(a, i);
}
sort(A.begin(), A.end... | 294 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
using infant= pair<int64_t, int>;
int N;
cin >> N;
priority_queue<infant> data;
int64_t val;
for(int i=0; i<N; i++){
cin >> val;
data.push(make_pair(val, i));
}
vector<int64_t> dp(N+1);
vector<int64_t> buf(N+1);
for(int n_perm=1;... | 332 |
Project_CodeNet | 2,020 | #include<iostream>
#include<cstdio>
#include<string>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<sstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN=2000;
in... | 362 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define ld double
#define oo 2e18
#define OS tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define rnd mt19937 rng(chrono::steady_clock::now().... | 371 |
Project_CodeNet | 2,020 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
typedef long long ll;
typedef long double lb;
#define int long long
#define double long double
#define endn "\n"
typedef pair<int,int> P;
template<class T> inline bool chmin(... | 706 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.