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;
int64_t dp[2010][2010];
int main() {
int n; cin >> n;
pair<int64_t, int64_t> a[n];
for(int i = 0; i < n; ++i) {
cin >> a[i].first;
a[i].second = i;
}
sort(a, a + n);
reverse(a, a + n);
for(int i = 0; i < n; ++i) {
int64_t val, idx;
tie(val, idx) = a[i];
fo... | 278 |
Project_CodeNet | 2,020 | //#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;
using ll = long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typenam... | 664 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
#define endl '\n'
#defi... | 879 |
Project_CodeNet | 2,020 | #include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
#include <numeric>
#include <functional>
using namespace std;
#define ALL(x) ... | 599 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int mod = 1e9 + 7;
const int N = 2002;
int n , dp[N][N];
pair<int , int> arr[2002];
int ans(int idx , int start , int end) {
if(end < start) return 0;
int& ge... | 324 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main() {
ll n;
cin >> n;
vector<pair<ll,ll>> a(n);
rep(i, 0, n) {
cin >> a[i].first;
a[i].second = i;
}
sort(a.begin(), a.end(), ... | 283 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
using ll = long long;
using namespace std;
using P = pair<ll, int>;
#define fi first
#define se second
#define amax(a, b) a = max(a, b)
int main() {
int n;
cin >> n;
int i = 0;
P babies[n]... | 333 |
Project_CodeNet | 2,020 |
#include <iostream>
#include <iomanip> //! for setprecision(10)
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
using namespace std;
typedef long long LL;
#define dump(c) { for (au... | 510 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/range/adaptor/reversed.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long int ll;
#define PI (acos(-1))
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define dump... | 522 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e3+5;
vector<pair<ll,int>> V;
int n;
ll dp[maxn][maxn];
int main() {
cin>>n;
for(int i=1;i<=n;i++){ll a;cin>>a;V.push_back({a,i});}
sort(V.begin(),V.end(),greater<pair<ll,int>>());
for(int i=0;i<n;i++){
dp[0][i+1... | 268 |
Project_CodeNet | 2,020 | //https://atcoder.jp/contests/abc163/tasks/abc163_e
//ABC100Dやれ
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll=long long;
const ll LINF = 0x1fffffffffffffff;
#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
template<class T>bool ... | 681 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define whole(f, x, ...) \
([&](decltype((x)) whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
})(x)
using namespace std;
using ll = long long;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {... | 396 |
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(a) (a).begin(),(a).end()
typedef long long ll;
using P = pair<ll, int>;
ll dp[2020][2020];
int main(void){
int n;
cin >> n;
vector<ll> a(n);
vector<P> p(n);
rep(i,n) {
cin >> a[i];
... | 325 |
Project_CodeNet | 2,020 | #include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<queue>
#include<stack>
#include<functional>
#include<tuple>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, bool... | 2,349 |
Project_CodeNet | 2,020 | #pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (... | 494 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (long l... | 456 |
Project_CodeNet | 2,020 | #pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | 870 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define mp make_pair
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define ff first
#define ss second
#define INF (ll) 1e9
#define endl "\n"
#define tt ll testcase; cin>>testcase; while(testcase--... | 420 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define SZ(a) (int)(a).size()
#define FOR(i, a, b) for(int i=(a); i<=(b); ++i)
#define iFOR(i, a, b) for(int i=(a); i>=(b); --i)
#define make_unique(a) sort(all((a))), (a).resize(un... | 447 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (int) n; i++)
#define rall(x) x.rbegin(), x.rend()
#define all(x) x.begin(), x.end()
#define PB push_back
#define F first
#define S second
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MAX 10000007
... | 313 |
Project_CodeNet | 2,020 | #include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
... | 1,729 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int somod = 1e9 + 7;
const int maxn = 2e3 + 7;
int n, m, a[maxn], dp[maxn][maxn], ans;
void Maximize(int &a, int b)
{
if(a < b) a = b;
ans = max(ans, a);
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fope... | 346 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
int main()
{
const int MAX_N = 2000;
int n;
std::cin >> n;
std::pair<long long, int> a[MAX_N];
for (int i = 0; i < n; ++i)
{
std::cin >> a[i].first;
a[i].second = i;
}
std::sort(a, a + n);
long long ans[MAX_N][MAX_N];
for (int j = 0; j <... | 311 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define dl double
using namespace std;
//***********************************************************************
int MAXNUM = 5e3+5;
vector <int>vis(MAXNUM);
vector<int> pr;
void sieve() {
pr.push_back(2);
for(ll i=3;i<MAXNUM;i+=2) if(!vis[i]) {
pr.push_back(i);
for(l... | 451 |
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 int
#define pb push_back
#define M 1000000007
#define inf 10000000000
#define ff first
#define ss second
#define deb(x) cout< #x< " "< x... | 1,011 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[2001][2001];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.t... | 446 |
Project_CodeNet | 2,020 | #define STOPIT
#include<bits/stdc++.h>
#define rep(i,n,m) for(int i = (n); i <(m); i++)
#define rrep(i,n,m) for(int i = (n) - 1; i >=(m); i--)
using namespace std;
using ll = long long;
void debug_impl() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) { cerr << " "... | 606 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, i... | 513 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (int)a; ++i)
#define REP(i, a, b) for (int i = (a); i < (int)b; ++i)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; }}
using namespace std;
using l... | 351 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long f (int v, int i, int j) {
return ((long long) v) * ((long long) abs(i - j));
}
signed main () {
int n;
cin >> n;
vector < int > a(n);
for (int &x: a)
cin >> x;
vector < pair < int, int > > b(n);
for (int i = 0; i < n; ++i)
b[i] = make_pair(a[i], i);
... | 342 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using lint = long long;
typedef pair<lint, lint> P;
signed main(){
lint N; cin >> N;
vector<P> a(2010);
for( lint i = 0; i < N; i++ ){
lint x; cin >> x;
a[i] = P(x, i);
}
sort( a.begin(), a.end(), greater<P>() );
lint ans = 0;
vector<vector<lint> > dp(... | 290 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(fal... | 406 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<pair<ll, int>> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i].first;
v[i].second = i;
}
sort(v.rbegin(), v.rend());
vector<vector<ll>> dp(N+1, vector<ll>(N+1));
for (int l = 0; l < N; l++) {
... | 275 |
Project_CodeNet | 2,020 | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int Maxn=2e3+5;
int n;
long long tmp,ans,dp[Maxn][Maxn];
struct A
{
int pos;
long long val;
}num[Maxn];
bool cmp(A a,A b)
{
return a.val>b.val;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>... | 302 |
Project_CodeNet | 2,020 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h... | 578 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 571 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>
#define ll long long
using namespace std;
int main(void)
{
int n;
cin >> n;
vector<pair<ll, int>> a = vector<pair<ll, int>>(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
}
s... | 329 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define exrep(i, a, b) for(long long i = a; i <= b; i++)
#define rep(i,n)for(long long i=0;i<(long long)(n);i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vect... | 441 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<int, int> P;
typedef tuple<int, int, int> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a... | 550 |
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 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template... | 621 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int const nax = 3e5 + 10;
using ll = long long ;
int n;
pair<int, int> a[nax];
ll dp[2048][2048];
int main () {
scanf("%d", &n);
for (int i = 1 ; i <= n ; ++ i) {
scanf("%d", &a[i].first);
a[i].second = i;
}
sort(a + 1, a + 1 + n, greater... | 402 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int N = 2048;
ll dp[N][N];
void solve() {
int n; cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
int x; cin >> x;
a[i] = {x,i};
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
... | 284 |
Project_CodeNet | 2,020 | /*
[ ( ^ _ ^ ) ]
*/
// problem: atc/abc163_e
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000
void maxself(ll &a, ll b) {
a = max(a, b);
}
int main() {
int n;
scanf("%d", &n);
vector<pair<ll, int>> a(n);
for(int i=0; i<n; i++) {
scanf("%lld", &a[i]... | 309 |
Project_CodeNet | 2,020 | #include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long ll;
int main() {
ll n,tmp;
ll ans=0;
cin >> n;
vector<pair<ll, ll>> children;
int front = 1, end = n;
for (int i = 1;i <= n;i++) {
cin >> tmp;
children.push_back(make_pair(tmp, i));
}
sort(... | 394 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define STR string
#define Fst first
#define Snd second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
int n;
... | 274 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
const int inf=1e9+7;
const ll INF=1LL<<61;
const ll mo... | 424 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
ll N;
cin >> N;
map<ll,set<ll> > A; // (score, {p1,...,ps})
for (ll i = 0; i < N; i++) {
ll a;
cin >> a;
A[a].insert(i + 1);
}
vector<vector<ll> > dp(N + 1, vector<ll>(N + 1, 0));... | 784 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int n;
long a[2000];
long dp[2001][2001];
int main() {
using PP = pair<long, long>;
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
vector<PP> v;
for (int i = 0; i < n; ++i) {
v.push_back(PP(a[i], i));
}
sort(v.begin(), v.end(), greater<PP>());
f... | 316 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <algorithm>
#include <utility>
#include <tuple>
using namespace std;
using ll = long long int;
const ll LONGINF = 1LL << 60;
ll N, dp[2020][2020];
pair<ll, ll> A[2020];
int main() {
scanf("%lld", &N);
for(int i=0; i<N; i++) {
ll v; scanf("%lld", &v);
A[i] = make_pair... | 342 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repr(i, n) for(int i = (n-1); i >= 0; --i)
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 (b<a) { a=b; return 1; } return 0; ... | 396 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLI = pair<LL, int>;
using VPLI = vector<PLI>;
template<class T> bool chmax(T &a, const T &b) {
if(a < b) {
a=b; retu... | 403 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define forr(i,a,n) for (int i = (a); i < (n); ++i)
#define rforr(i,a,n) for (int i = (a); i > (n); --i)
#define ALL(x) x.begin(),x.end()
#define LEN(X) ((int)(X).size())
#define CASET int _T; cin >> ... | 463 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define ITR(v, i) for(auto ite = v.begin(); ite != v.end(); ite++)
const ll INF = 999999999999999;
c... | 441 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define FORW(a, b, c) for(int a = b; a >= c; --a)
#define fi first
#define se second
#define pb push_back
#define int long long
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
const int N = 2e3 + 100;
const int maxN =... | 464 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int a[2005];
pair <int, int> b[2005];
long long dp[2005][2005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) b[i] = make_pair(a[i], i);
sort(b + 1, b + 1 + n, greater<pair<int, int>>());
dp... | 329 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using ll = long long;
const int maxn = 2e3 + 3;
int n, a[maxn], o[maxn];
ll d[maxn][maxn];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; ++i) {
scanf("%d", a + i);
}
std::iota(o + 1, o + n + 1, 1);
std::sort(o + 1, o + n + 1, [] (int i, int j) {
ret... | 312 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#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--)
typedef long long LL;
int N;
LL A[2001];
typedef pair<LL,int>P;
vector<P>v;
LL dp[3001][3001];
... | 363 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const double eps = 1e-8;
const int NINF = 0xc0c0c0c0;
const int INF = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
const ll maxn = 1e6 + 5;
const int N = 2000 + 5;
int n;
pair<ll,int> a[N];
ll f[N][N];
int main(){
ios::sync_with_st... | 310 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <random>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <sstream>
#include <bitset>
#include <cassert>
#include <fstream>
#include <queue>
#define le... | 1,034 |
Project_CodeNet | 2,020 | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <iomanip>
using ll = long long int;
using P = std::pair<ll, int>;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mo... | 403 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
vector<pair<ll, int>> a(n);
rep(i,n){
ll x;
cin >> x;
a[i] = make_pair(x, i);
}
sort(a.rbegin(), a.rend());
vector<vecto... | 282 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <string.h>
using namespace std;
#define pie 3.141592653589... | 601 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <stdio.h>
#include... | 2,568 |
Project_CodeNet | 2,020 | /*
Name: Active Infants
Description: abc163_e
History:
Number Time Author details
1 2020.4.20 15:00 JerryDream NULL
*/
#include "bits/stdc++.h"
using namespace std;
struct child
{
int id;
long long val;
bool operator < (child it)
{
if(v... | 357 |
Project_CodeNet | 2,020 | #include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloa... | 354 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <s... | 805 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll p=1e9+7;
struct aaa{
ll x,y;
}a[2010];
ll n,ans,f[2010][2010];
bool cmp(aaa a,aaa b){
return a.x>b.x;
}
int main(){
ll i,j,w,x;
scanf("%lld",&n);
for(i=1;i<=n;i++){
scanf("%lld",&a[i].x);
a[i].y=i;
}
sort(a+1,a+n+1,cmp);
for(i=1;i<=n... | 252 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[2000+100][2000+100];
signed main(){
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;
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
for(int x=0;x<N;x++){
for(int y=0;y<N;y++)... | 226 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int mod=7+1e9;
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll qpow(ll a,ll b,ll p){a%=p; ll ret=1;for(;b;b>>=1,a=a*a%p) if(b&1) ret=ret*a%p; return ret;}
ll getInv(ll x,ll p){re... | 382 |
Project_CodeNet | 2,020 | #define ANSWER
#include<cmath>
#include<vector>
typedef long long ll;
namespace mybig
{
long long MOD = std::pow(10,9)+7;
ll fac_size = 2 * std::pow(10,5) + 2;
void Calcfac();
bool calcurated_fac = false; //n!(mod M)
std::vector<long long> fac; //n!(mod M)
std::vector<long long> ifac; //k!^{M-2} (mod M)
ll pow(ll x, ll... | 4,854 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define INF 2000000000
typedef long long int ll;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define getbit(n,i) (((n)&(1LL<<(i)))!=0)
#define setbit0(n,i) ((n)&(~(1LL<<(i))))
#define setbit1(n,i) ((n)|(1LL<<(i)))
#define ... | 469 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FOR0(i,n) for(i=0;i<n;i++)
#define FOR(i,j,n) for(i=j;i<n;i++)
#define FORD(i,j,k) for(i=j;i>=k;i--)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define inf 1000000000
#define n... | 755 |
Project_CodeNet | 2,020 | /* aman36 - Aman Raj */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define pb push_back
#define pp(a, b) pair <a, b>
#define ll long... | 1,461 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define mem(a,h)... | 517 |
Project_CodeNet | 2,020 | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
void *wmem;
char memarr[96000000];
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){
static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7,... | 1,750 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | 768 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){c... | 2,603 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class I,class V=typename I::value_type>V sum_up(const I&l,const I&r){V v;for(I i... | 594 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define DEBUG(...)
#endif
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;
auto chmax = [](auto&& a, auto b) { return a < b ? a = b, 1 : 0; };
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int... | 358 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 489 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
static const int INF = 1001001001;
static const int MAX = 2005;
ll dp[MAX][MAX];
int main(){
int n; cin >> n;
vector<int> a(n);
rep(i,n) cin >> ... | 309 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define rrep(i,n) for(int i=(int)n-1;i>=0;--i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template<typename T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T> inline bool chmin(T& a,T b){if(b<... | 522 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i,n) for (ll i = 0; i < n; ++i)
#def... | 590 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define PII pair<int,int>
#define ls x<<1
#define rs x<<1|1
#define fi first
#define se second
#define pb push_back
#define cwk freopen("D:\\c++\\in.txt","r",stdin),freopen("D:\\c++\\out.txt","w",stdout)
using namespace std;
const int N=2e3+10;
ll dp[... | 340 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define P pair<int, int>
#define dint long double
const int mod = 998244353;
inline int add(int a, int b) { int res = a + b; if(res >= mod) res -= mod; return res; }
inline int sub(int a, int b) { in... | 479 |
Project_CodeNet | 2,020 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
//vector string deque break continue
#define forn(i, s, f) for (int i = (int)s; i < (int)f; i++)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define fs first
#define sc second
#define... | 552 |
Project_CodeNet | 2,020 | #include<iostream>
#include<utility>
#include<cmath>
#include<algorithm>
using namespace std;
int main(){
pair<long long,int> order[2020];
int n;
cin>>n;
for(int i=0;i<n;i++){
long long temp;
cin>>temp;
order[i]=make_pair(temp,i+1);
}
sort(order,order+n);
reverse(ord... | 297 |
Project_CodeNet | 2,020 | #line 1 "/mnt/c/Users/leafc/dev/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#defin... | 498 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (int)a; ++i)
#define REP(i, a, b) for (int i = (a); i < (int)b; ++i)
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cerr << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) cerr << #x1 << ": " << x1 << ", " ... | 680 |
Project_CodeNet | 2,020 | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){
if(a<b){
a=b;
return true;
}
return false;
}
template<typename T> bool chmin(T &a,T... | 475 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end... | 1,268 |
Project_CodeNet | 2,020 | #include<stdio.h>
#include<stdlib.h>
#define max(a,b) ((a)>(b)?(a):(b))
#define abs(a) ((a)>0?(a):-(a))
typedef long long ll;
ll dp[2020][2020];
ll n,a[2020],p[2020];
int cmp(const void*i,const void*j){
return a[*(ll*)j] - a[*(ll*)i];
}
int main(){
ll i,x,y, ans;
bool moved[2020] = {false,};
scanf("%lld",&n);
... | 358 |
Project_CodeNet | 2,020 |
#include <limits>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
ty... | 419 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
int dp[2010][2010];
int a[2010];
struct node
{
int first;
int second;
}c[5001];
bool cmp(node p1,node p2)
{
return p1.second>p2.second;
}
int work(int now,int l,int r)
{
if (l>r) return c[now].second;
if (dp[l][r... | 403 |
Project_CodeNet | 2,020 | //#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
type... | 463 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=2e3+5;
inline int read(){
char c=getchar();int t=0,f=1;
while((!isdigit(c))&&(c!=EOF)){if(c=='-')f=-1;c=getchar();}
while((isdigit(c))&&(c!=EOF)){t=(t<<3)+(t<<1)+(c^48);c=getchar();}
return t*f;
}
int n,a[maxn],vis[maxn],fd[maxn],m,b[... | 326 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize ("-ffloat-store") // to restrict undesirable precision
#pragma GCC optimize ("-fno-defer-pop")// to pop argument of function as soon as it returns
#define all(a) a.begin(),a.end()
#define... | 539 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define LL long long
#define PLL pair<LL, LL>
#define x first
#define y second
using namespace std;
const LL INF = (LL) 1e18 + 5;
//const LL MOD = (LL) 1e9 + 7;
const int MAXN = 2005;
LL n, dp[MAXN][MAXN], A[MAXN];
PLL ord[MAXN];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin... | 332 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define lwb lower_bound
#define upb upper_bound
#define all(a) (a).begin(), (a).end()
#define Reset(s, n) memset(s, n, sizeof(s))
#define Sz(a) int((a).... | 978 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<ll,ll> ii;
typedef pair<ii,ll> iii;
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X... | 825 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.