Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | 584 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
// 子どもを表す構造体
struct infant{
int position; // 位置
int64_t lively; // 活発度
// 活発度が同じ場合、位置で判断する
bool operator<( const infant &right ) const{
return lively == right.lively ? position < right.position : lively < right.lively;
}
... | 683 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >... | 446 |
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;
using namespace std ;
#define int long long
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define mod 1000000007
typedef tree<int,null_type,less<int>,rb... | 361 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N=2020;
int n;
int a[N],p[N];
ll dp[N][N];
ll f(int l,int r)
{
int dep=l+r+1;
if (dep>n) {
return 0;
}
if (dp[l][r]!=-1) return dp[l][r];
if (dep==n) {
return dp[l][r]=1LL*a[p[n]]*abs(l+1-p[n]);
}
... | 272 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZER... | 439 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long dp[2005][2005];
int main() {
int n;
cin>>n;
long long a[n];
for (int i=0; i<n; i++) cin>>a[i];
for (int i=0; i<n+1; i++) {
for (int j=0; j<n+1; j++) {
dp[i][j] = 0;
}
}
pair<long long, int> pa[n];
for (int i=0; i<n; i++) pa[i] = make... | 402 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define debug(x) cout<<#x<<" :: "<<x<<endl;
#define debug2(x,y) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<endl;
#define debug3(x,y,z) cout<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<endl;
#define debug4(x,y,z,... | 362 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
long long n, a, dp[2005][2005];
vector <pair<int, int> > v;
long long solve(int l, int r){
if (~dp[l][r]) return dp[l][r];
if (l > r) return dp[l][r] = 0;
int idx = (r-l);
return dp[l][r] = max(solve(l+1... | 225 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mii map<int,int>
#define... | 427 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using pil = pair<int, ll>;
using uint = unsigned int;
template <typename T>
using Graph = vector<vector<T>>;
const ... | 371 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdi... | 2,120 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int main(){
int N;
cin >> N;
vector<pair<long long,int>> A;
for(int i = 0; i < N; ++i){
int a;
cin >> a;
A.emplace_back(a,i);
}
sort(A.rbegin(), A.rend());
vector<long long> dp(N+1,0);
for(int... | 224 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <set>
#include <map>
#define int long long
using namespace std;
typedef long double ld;
typedef pair<int, int> pa;
typedef long long ll;
const int mod = 1e9 + 7, N = 1e5;
const ld pi = 3.1415926535;
signed main() ... | 427 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define fi first
#define se second
#define pb push_back
#define forn(i,n) for(int i=0;i<(n);i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forr(i,n) for(int i=n;i>=0;i--)
#define all(x) x.begin(), x.end()
const int MAXN = 2e3 +5;
void fio(){
io... | 376 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int A[N+1];
for(int i=0; i<N; i++) cin >> A[i+1];
int64_t dp[2001][2001] = {};
dp[0][0] = 0;
bool checked[2001] = {};
for(int i=1; i<=N; i++){
int Max_num = 0;
int64_t baby;
for(int j=1; j<=N; j++){
... | 390 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 10, mod = 1e9 + 7;
pair<int, int> arr[N];
long long dp[N][N];
int n;
long long solve(int i, int l) {
if(!arr[i].first) return 0;
if(dp[i][l] != -1) return dp[i][l];
int r = n - (i - l);
long long ret = solve(i + 1, l + 1) + 1ll * arr[i... | 600 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define out1(a) cout<<#a<<" "<<a<<endl
#define out2(a,b) cout<<#a<<"... | 825 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define FF first.first
#define FS first.second
#define pb push_back
using namespace std;
const ll N=1000006, INF=1e16, MOD=1000000007;
ll n, q=1, a[N], b[N], dp[2020][2020], m, x, y, z, X, Y, Z, o, u, h, w, mx, mn, ans, Ans;
string s,... | 386 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
typedef long long LL;
const int N = 2007;
int n;
pair<int, int> a[N];
LL dp[N][N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(int i = 0; i < n; ++i) {
cin >>... | 310 |
Project_CodeNet | 2,020 | //#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//# include <x86intrin.h>
# include <bits/stdc++.h>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
us... | 834 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define INF 100000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<pll> a_ind(N);//a, index
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
a_ind.at(i) = {A.at(i), i};
}
sort(a_ind.begin(), a_ind.e... | 507 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <algorithm>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n;
ll a[2005];
pair<ll, ll> b[2005];
ll d[2005][2005];
ll ans;
int main()
{
scanf("%lld", &n);
for(ll i = 1; i <= n; i++)
{
scanf("%lld", &a[i]);
b[i]... | 307 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
using namespace std;
ll dp[2000][2000];
ll func(pair<ll,int> *arr, int N, int i=0, int first=0)
{
if(i==N)
return 0;
if(dp[i][first]==-1)
{
int last=N-1-(i-first);
ll frontMove=abs(arr[i].second-first);
ll backMove=abs(arr[i].second-last... | 286 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint mod = 998244353;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < (n);... | 1,268 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(co... | 1,199 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 498 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
#define forinc(i,a,b) for(int i=a;i<=b;i++)
#define fordec(i,a,b) for(int i=a;i>=b;i--)
#define pii pair<int,int>
#define int long long
#def... | 377 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb(x) push_back(x)
#define f(i,st,n) for(i=st;i<n;i++)
#define qu queue
#define ps(x) push(x)
#define vec vector
#define ft() front()
#define mst(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
#define sfl(x) scanf("%lld",&x)
#define pfl(x)... | 466 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
ll dp[2005][2005];
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<P> p;
rep(i, n) p.emplace_back(a[i], i);
sort(p.rbegin(), ... | 252 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n,m,i,j,k,ans,cur;
cin >> n;
vector<pair<long,long>> a(n);
for(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>> dp(n+1,vector<long>(n+1,0));
for(i=0; i<n; i++){
fo... | 248 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<unordered_map>
#include<stack>
#include<string>
#include<algorithm>
#include<functional>
#include<cstring>
#include<complex>
#include<bitset>
#include<iostream>
#include<cassert>
using namespace std;
typedef long long ll;
typedef un... | 2,929 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
const int SIZE = 2005;
typedef long long ll;
ll A[SIZE], dp[SIZE][SIZE];
pair<int, int> lr[SIZE][SIZE];
bool comp (const pair<ll, ll> &p1, const pair<ll, ll> &p2){
return p1 > p2;
}
int main(){
int N; cin >> N;
lr[0][0] = make_pair(1, N);
vector<pair<ll, ... | 435 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 1000000007
#define llMAX 9223372036854775807
#define llMIN -9223372036854775808
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n,k,x,y;
//2... | 917 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
pair<ll,ll> ar[2000+9];
ll dp[2009][2009],n;
ll rec(ll idx,ll i,ll j)
{
if(idx==n+1)
return 0;
if(dp[i][j]!=-1)
return dp[i][j];
return dp[i][j]=max(rec(idx+1,i+1,j)+((ar[idx].first)*abs(ar[idx].second-i)),rec(idx+1,i,j-1)+((ar[idx].first)*abs(ar[... | 229 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;using ll=long long;using uint=unsigned int;using pii=pair<int,int>;using pll=pair<ll,ll>;using ull = unsigned long long;using ld=long double;template<typename T>void _(const char*s,T h){cerr<<s<<" = "<<h<<"\n";}template<typename T,typename...Ts>void _(const char*s,T h,Ts...t... | 597 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
typedef long long ll;
#define endl '\n'
using namespace std;
const int MOD = 1000000007, MAX = 2000000007, MAXN = 2005;
pair<ll,int> p[MAXN];
ll dp[MAXN][MAXN];
ll solve(int n)
{
for(int i=0; i<n; i++)
dp[i][i] = p[0].first*(abs(i-p[0].second));
for(int k=1; k<n; k++)
{
... | 319 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+50;
int t,n,m;
int arr[maxn];
struct node
{
ll x;int id;
}poi[2050];
bool comp(node a,node b)
{
if(a.x!=b.x) return a.x>b.x;
return a.id>b.id;
}
ll dp[2050][2050];
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1;i<... | 306 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define fst first
#define snd second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define EPS (1e-9)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
bool LT(double a,double b) { return !equals(a,b) && a ... | 961 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define N 3000
#define M 1000000007
#define pii pair<ll,ll>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
vector<pii>v;
ll dp[N][N];
int n;
ll run(int idx,int first)
{
if(idx==n)
return 0;
if(dp[idx][first]!=-1)
return dp[... | 249 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define fo(i,a,b) for((i)=(a);i<=(b);i++)
#define rfo(i,a,b) for((i)=(a);i>=(b);i--)
#define inrange(x,y,z) (((x)>=(y))&&((x)<=(z)))
#define ALL(vec) ((vec).begin(),(vec).end())
#define SOR(vec) sort(ALL(vec))
#define UNI(vec) (vec).erase(unique(ALL(vec)),(vec).end())
using namespace std;
int n;... | 374 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main(){
//入力受付
long N;
cin >> N;
vector<pair<long,long> > A(N);//それぞれにactivenessとindexを入れる
for(long i=0;i<N;i++){
cin >> A[i].first;
A[i].second = i;
//cout << A[i].first << "," << A[i].second << endl;
}
//sort
sort(A.rbegin(),A.rend());
... | 504 |
Project_CodeNet | 2,020 | #include"bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queu... | 758 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <cstdlib>
#include <cmath>
#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 <complex>
#include <stack>
#include... | 442 |
Project_CodeNet | 2,020 | // abc163_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n)... | 649 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define YES puts("YES")
#define Yes puts("Yes")
#define NO puts("NO")
#define No puts("No")
#define ALL(v) (v).begin(), (v).end()
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
t... | 1,159 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int N;
ll A[2000];
P p[2000];
ll dp[2005][2005];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << set... | 364 |
Project_CodeNet | 2,020 | #pragma region header
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ld long double
#define vi vector<int>
#define vvi vector<vector<int>>
#define vvvi vector<vector<vector<int>>>
#define vs vector<string>
#define vvs vector<vector<string>>
#define vvvs vector<... | 1,535 |
Project_CodeNet | 2,020 | // #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 2005;
ll dp[N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(n... | 330 |
Project_CodeNet | 2,020 | #define _GLIBCXX_DEBUG
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define FOR(i,n,m) for(ll i=n; i<(ll)m;i++)
#define FORr(i,m,n) for(ll i=n; i>=(ll)m; i--)
#define FORm(i,m) for(auto i=m.begin();i!=m.end();i++)
#define ... | 491 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int M=2010;
int n;
ll dp[M][M],ans;
struct elem{
ll val,pos;
bool operator<(elem tmp)
{return val>tmp.val;}
}a[M];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i].val),a[i].pos=i;
sort(a+1,a+n+... | 334 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; retur... | 402 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#define ll long long
using namespace std;
ll dp[2010][2010];
struct node {
int id;
int val;
}a[2010];
int cmp(node a, node b) {
return a.val < b.val;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i].val);... | 286 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef struct{
int pos_before;
long long A;
}INFANT;
bool cmp(INFANT& a, INFANT& b){
return a.A>b.A;
}
long long absval(long long n){
return n<0?-n:n;
}
int main(){
int N;
cin >> N;
int afterPos[N]={0};
INFANT infant[N];
long long dp[N+1]... | 517 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... | 695 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp> // Common file
#include<ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pp pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define a... | 503 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
using namespace std;
struct kid {
int index;
long long int value;
};
bool operator < (struct kid a, struct kid b) {
return a.value < b.value;
}
long long int ans;
long long int dp[2001][2001];
int main() {
int N;
priority_queue<s... | 488 |
Project_CodeNet | 2,020 | //競技プログラミング用のテンプレート
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <math.h>
#include <stack>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repr(i, n) for(int i = n - 1; i >= 0; i--)
using namespace std;
using ll = long long in... | 460 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 550 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[2005];
int v[2005];
ll dp[2005][2005];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
}
iota(v,v+1+n,0);
sort(v+1,v+1+n,[](const int &... | 274 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define xx first
#define yy second
pll a[2009];
ll dp[2009][2009],n;
ll solve(ll i,ll j)
{
if(i==(n+1)) return 0LL;
if(dp[i][j]!=-1) return dp[i][j];
ll k = n-(i-j);
ll ans1 = a[i].xx * (abs(a[i].yy-j)) + solve(i... | 259 |
Project_CodeNet | 2,020 | #define ll long long
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int n;
vector<ll> arr;
void solve() {
vector<int> idx(n);
for (int i=0; i<n; ++i) {
idx[i] = i;
}
sort(idx.begin(), idx.end(), [](int i, int j) {
return arr[i] > arr[j];
});
vector<vector<ll> > dp(n, ve... | 329 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
... | 523 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ll mod = 1e9 + 7;
//const ll mod = 998244353;
#define REP(i,n) for(int i=0;i<(int)n;++i)
//debug
#define dump(x) cerr << #x <... | 682 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<int(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr int INF = 1001001001;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<cla... | 588 |
Project_CodeNet | 2,020 | // atcoder/abc163/E/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... | 804 |
Project_CodeNet | 2,020 | // #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predic... | 952 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | 626 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#ifdef __LOCAL
#define DBG(X) cout << #X << " = " << (X) << endl;
#define SAY(X) cout << (X) << endl;
#include <filesystem>
namespace fs = std::filesystem;
#else
#define DBG(X)
#define SAY(X)
#endif
using namespace std;
using ll = long long int;
using ull = unsigned lo... | 1,112 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2087;
ll dp[N][N];
pair<int, int> a[N];
int main()
{
ll n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i].first;
a[i].second = i + 1;
}
sort(a, a + n);
for (int w = 1; w <= n; ++w) {
in... | 217 |
Project_CodeNet | 2,020 | //#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
using namespace std;
... | 518 |
Project_CodeNet | 2,020 | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#pragma comment (linker, "/STACK:526000000")
#include "bits/stdc++.h"
using namespace std;
typedef string::const_iterator State;
#define eps 1e-12L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL
#define MOD 998244353LL
#define pb push_back
#define mp... | 7,165 |
Project_CodeNet | 2,020 | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include<bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
// a new data structure defined. Please refer below
// GNU link : https://goo.gl/WVDL6g
typedef tree<int, null_type, less_equal<int>, rb_tree_tag... | 1,166 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <vector>
#include <string>
#include <bitset>
#include <queue>
#include <tuple>
#include <regex>
#include <cmath>
#include <map>
#include <cstring>
using namespace std;
template<typename T> bool chmax( T &a, const T b ) { if ( a <=... | 2,596 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
using namespace std;
//typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
#def... | 918 |
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;
typedef pair<ll, ll> pll;
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; }
i... | 351 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n);
vector<pair<ll, ll>> b(n);
for (int i = 0; i < n; i++) {
... | 333 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
bool print_space_enable = false;
void print() {
cout << endl;
print_space_enable = false;
}
template <class ... | 572 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
vecto... | 342 |
Project_CodeNet | 2,020 | // Date: 2020-04-20
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<LL, LL> pll;
typedef pair<int, int> pii;
#define IO freopen("in.txt", "r", stdin);freopen("out.txt", "w", stdout)
#define FIO ios::sync_with_stdio(false);cin.tie(0);cout... | 607 |
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 ff first
#define ss second
#define pb(x) push_back(x)
#define mp make_pair
#define sz(x) (in... | 1,596 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<Int, Int> P;
int main(){
Int N; cin >> N;
vector<P> infant;
rep(i,N){
Int A; cin >> A;
infant.push_bac... | 315 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <utility>
#include <functional>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
int N;
vector<pi> A;
vector<vector<ll> > DP;
void input_init(void) {
cin >> N;
A.resize(N);
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
... | 381 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector< pair<long long, int> > a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
}
sort(a.rbegin(), a.rend());
vector< vector<long long> > dp(n + 1, vecto... | 274 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) sort(ALL(c));for(bool c##p=1;c##p;c##p=next_permutation(ALL(c))... | 1,166 |
Project_CodeNet | 2,020 | #ifdef LOCAL
#include <header.hpp>
#else
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#endif
#define lp(i, l, r) for (int i = int(l); i <= int(r); ++i)
#define rp(i, r, l) for (int i = int(r); i >= int(l); --i)
#define ls(i, s) for (int i = 0; s[i]; ++i)
#def... | 2,618 |
Project_CodeNet | 2,020 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<long long>;
using PII = pair<int, int>;
using PLL = pair<long long, long long>;
//#pragma GCC... | 2,388 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define int long long
#define gmax(x,y) x=max(x,y)
#define gmin(x,y) x=min(x,y)
#define F first
#define S second
#define P pair
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define V vector
#define RE return
#define ALL(a) a.begin... | 352 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <string.h>
#include <iostream>
#include <stdio.h>
using namespace std;
typedef long long LL;
const int N = 2020;
struct node {
LL p, v;
}a[N];
LL f[N][N]; //dp[i][j] i表示移左边数量 j表示移右边数量
bool cmp(node x, node y) {
return x.v > y.v;
}
int main() {
int n;
cin >> n;
for (int i = 0; i <... | 317 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
vector<pair<ll, ll>> vec(3000);
ll dp[3000][3000];
ll n;
ll solve(ll l, ll r){
if(l>r)return 0;
if(dp[l][r]!=-1)return dp[l][r];
ll idx=(n-(r-l+1)+1);
ll ans1=abs(l-vec[idx].s)*vec[idx].f + solve(l+1,r);
ll a... | 238 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define fr(i,k,n) for(int i=k;i<n;i++)
#define read(x) cin>>x
#define ll long long int
#define mod 1000000007
#define print(x) cout<<x<<endl
#define pb(x) push_back(x)
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main() {
fastIO;
ll ... | 381 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll fun(ll lo, ll hi,ll index, vector<pair<ll,ll>> &vec,map<pair<ll,ll>,ll> &ma)
{
if(lo>hi)
return 0;
if(lo==hi)
{
ll temp=(vec[index].first)*abs(lo-vec[index].second);
ma[make_pair(lo,hi)]=temp;
return temp;
... | 371 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
int n;
struct abdata {
long long a; long long b;
};
bool cmp(const a... | 361 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i].first;
a[i].second = i + 1;
}
sort(a.begin(), a.end(), greater<pair<int, int... | 323 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... | 531 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define ll long long
#define int ll
#define mp make_pair
using namespace std;
const int inf = 1e9 + 7;
const ll ll_inf = 1e18 + 7;
const int K = 2e5;
const int N = 2e5 + 300;
... | 463 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define _GLIBCXX_DEBUG
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vvd = vec... | 407 |
Project_CodeNet | 2,020 | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll dp[2001][2001],n,a,ans;
vector<P> v;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
v.push_back({a,i});
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
f... | 290 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
vector<pair<long long,long long>> a(20001);
long long dp[2001][2001];
int main()
{
long long n;
cin>>n;
for(long long i=0;i<n;i++)
{
long long x;
cin>>x;
a[i] = make_pair(x,i+1);
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
for(lon... | 309 |
Project_CodeNet | 2,020 | // -----------------------------------
// Author : MatsuTaku
// Country : Japan
// Created : 04/19/20 22:30:24
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int n; cin>>n;
vector<... | 296 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.