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;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
vector<int> order;
for (int i = 0; i < N; i++) order.push_ba... | 296 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
const int N = 4005;
typedef long long ll;
ll ans, f[N][N], res;
int n;
struct node {
ll val;
int pos;
} a[N];
bool cmp(node a, node b) { return a.val > b.val; }
int main() {
cin>>n;
for(int i = 1; i <= n; i++) {
cin>>a[i].val;
a[i].pos = i;
}
sort(a + 1, a + n ... | 307 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
size_t N;
cin >> N;
vector<pair<long long, long long>> a(N + 1);
vector<vector<long long>> dp(N + 1, vector<long long>(N + 1, 0));
for (size_t i = 1; i <= N; ++i) {
cin >> a[i].f... | 336 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N = 2020;
long long dp[N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[... | 246 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class... | 381 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | 371 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define ul unsigned long long int
#define ld long double
#define f(t) for(int i =0;i<t;i++)
#define vi vector<int>
#define vl vector<ul>
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000007
#define inf 4e18
#define EPS 1e-... | 502 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
int main()
{
int64_t n;
cin >> n;
vector<pair<int64_t, int64_t>> a(n); // <数値, 元のindex>のpair
for (int64_t i = 0; i < n; i++) {
int64_t a_in;
cin >> a_in;
a.at(i) = make_pair(a_in, i);
}
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
int64_t dp[2001... | 559 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class... | 660 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e3 + 5;
ll f[N][N];
pair<int, int> p[N];
ll cal(int cnt, int l, int r) {
if(l > r) return 0;
if(~f[l][r]) return f[l][r];
ll ans = 1LL * p[cnt].first * abs(p[cnt].second - l) + cal(cnt + 1, l + 1, r);
ans = max(ans, 1LL * ... | 285 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<P> p(n);
vector<vector<ll>> dp(n+1,vector<ll>(n+1));
rep(i,n){
int a;cin >> a;
... | 268 |
Project_CodeNet | 2,020 | /*
/+==================================================+\
//+--------------------------------------------------+\\
|.|\\...>>>>>>> Hollwo_Pelw(ass) 's code <<<<<<<...//|.|
\\+--------------------------------------------------+//
\+==================================================+/
*/
#include <bits/stdc++.h>
using ... | 911 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool uin(T& a, T b) { return a > b ? (a = b, true) : false; }
template <class T>
inline bool uax(T& a, T b) { return a < b ? (a = b, true) : false; }
const int nax = 2010;
long long dp[nax][nax];
long long A[nax];
int N;
int main() {
ios::sync_... | 341 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
struct node{
int id;
ll val;
bool operator<(const node&n)const
{
return val > n.val;
}
}a[2005];
ll dp[2005][2005][2];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++)
... | 522 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
typedef long long LL;
typedef pair <LL, LL> PII;
vector<PII> a;
LL dp[2005][2005];
int n;
LL solve(int l, int r){
if (l > r) return 0;
if (dp[l][r]) return dp[l][r];
int i = r - l;
return dp[l][r] = max(solve(l, r - ... | 228 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
long long n,a[2009],dp[2009][2009],id[2009],ans;
bool cmp(long long b1,long long b2){return a[b1]>a[b2];}
int main()
{
cin >> n;
for(long long i = 1;i<=n;i++)cin >> a[i],id[i] = i;
sort(id+1,id+n+1,cmp);
for(long long i = 1;i<=n;i++)
{
... | 321 |
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<int, int>;
int main() {
int n;
cin >> n;
vector<int> A(n);
vector<P> B(n);
rep(i, n) {
cin >> A[i];
B[i] = P(A[i], i);
}
sort(B.rbegin(), B.rend()... | 259 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<sstream>
#include<set>
#include<queue>
using namespace std;
typedef long long ll;
typedef pair<int,int>PII;
typedef pair<ll,ll>PLL;
#define make_pair mkp;
const int maxn=2e... | 369 |
Project_CodeNet | 2,020 | #pragma GCC optimize ("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(c... | 1,751 |
Project_CodeNet | 2,020 | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<ran... | 605 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using ull=unsigned long long;
using uint=unsigned int;
using pcc=pair<char,char>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using pdd=pair<double,double>;
using tuplis=pair<ll,pll>;
using tuplis2=pair<pll,ll>;
template<class T... | 2,993 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long int)(998244353)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define FOR(i,a,b) for(int i=a... | 562 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define eb emplace_back
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
const int N = 2007;
vector<ii> vec;
ll memo[N][N];
int n;
ll solve(int l, int r) {
if(l > r) return 0;
ll & st = memo[l][r];
if(s... | 287 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef std::pair<int, ll> pr;
int main(int, char**)
{
int n;
vector<pr> a;
cin >> n;
int tmp;
for (int i = 0; i < n; i++) {
cin >> tmp;
a.push... | 390 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 2005
#define INF 10000000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
int n;
P A[SIZE];
ll dp[SIZE][SIZE];
int main(){
cin >> n;
rep(i,0,n){
cin >> A[i+1].first... | 368 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L"... | 746 |
Project_CodeNet | 2,020 | #pragma region Macros
#include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).rbegin(), (x).rend())
#define ALL(x) (x).begin(), (x).end()
#define REV(x) reverse(ALL(x))
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m... | 1,019 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<long long, long long>>A(N);
for (long long n = 0;n<N; ++n) {
long long m;
cin >> m;
A.push_back(make_pair(m,n + 1));
}
sort(A.rbegin(),A.rend());
const int MX = 2005;
vector<vector<long long >> DP(N + 10, vector<lo... | 308 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
int main()
{
size_t N;
cin >> N;
vector<long long> A(N);
for (long long &a : A)
{
cin >> a;
}
priority_queue<pair<long long, size_t>> q;
for (size_t i = 0; i < N; i++)
{
q.push(make_pair(A[i], i));
}
vector<vec... | 317 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#def... | 471 |
Project_CodeNet | 2,020 | #define DEBUG 0
/**
* File : E.cpp
* Author : Kazune Takahashi
* Created : 6/24/2020, 1:30:14 AM
* Powered by Visual Studio Code
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <c... | 2,101 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
pair<ll, int> a[100010];
ll mem[2010][2010], n;
ll dp(int x, int y){
if(x+y==n){
return 0;
}
if(mem[x][y]!=-1){
return mem[x][y];
}
ll res=0;
int tmp=n-x-y-1;
re... | 254 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a.at(i);
vector<pair<ll, ll>> x(n);
for (int i = 0; i < n; i++) {
x.at(i).first = a.at(i);
x.a... | 347 |
Project_CodeNet | 2,020 | /*input
*/
// assic value of ('0'-'9') is(48 - 57) and (a-z) is (97-122) and (A-Z) is(65-90) and 32 for space
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb ... | 782 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define ll long long
#define endl '\n'
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define mod 1000009
#define line cout<<"--------------------------"<<endl
#define fast ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define filein freopen("input.txt","r"... | 306 |
Project_CodeNet | 2,020 | //#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
ll n;
cin>>n;
vector<pair<ll,ll>> active_pos;
for (ll i = 0; i < n; ++i)
{
ll tmp;
cin>>tmp;
active_pos.push_back(make_pair(tmp,i));
}
... | 295 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define drep2(i, m, n) for(int i=int(m-1); i>=int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long... | 828 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
void read (int&a) {
a = 0; char k = getchar(); int f = 1;
for(;!isdigit(k); k = getchar()) if (k == '-') f = -1;
for(; isdigit(k); k = getchar()) a = a * 10 + k - '0';
a *= f;
}
const int N = 2000 + 5;
int a[N], id[N], ... | 457 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... | 534 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int... | 659 |
Project_CodeNet | 2,020 | //Solution by Tima
#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define pb push_back
#define vi vector <int>
#define ld long double
#define pii pair<int, int>
#define y1 sda
#define all(x) x.begin(), x.end()
using namespace std; ... | 303 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
... | 365 |
Project_CodeNet | 2,020 | /*input
6
8 6 9 1 2 1
*/
/*
**************************
* *
* AUTHOR :: knight_coder *
* *
**************************
*/
#include<bits/stdc++.h>
#define lld long long int
#define pb push_back
#define ppb pop_back
#define endl '\n'
#define mii map<lld,lld>
#define msi ... | 633 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...)name
#define _rep(i,n)repi(i,0,n)
#define repi(i,a,b)for(int i=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'... | 452 |
Project_CodeNet | 2,020 | #include <iostream> // cin, cout, cerr
#include <algorithm> // minmax, sort, swap
#include <numeric> // iota
#include <cstdio> // printf, scanf
#include <string> // string, stoi, to_string
#include <vector> // vector
#include <queue> // queue, priority_queue
#include <deque> // deque
#include <map> // key-value pairs s... | 630 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
struct child {
ll aval, i;
};
struct child arr[2001];
bool comp(struct child a, struct child b) {
if(a.aval == b.aval) return a.i < b.i;
return a.aval > b.aval;
}
ll dp[2001][2001];
ll solve(int l, int r) {
if(dp[l][r] !=... | 286 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2005;
bool used[N];
int n,x[N];
ll dp[N][N];
int l,r,num;
ll ans,mx;
int main()
{
cin>>n;
r=n-1;
for(int i=0;i<n;i++)cin>>x[i];
for(int i=0;i<n;i++)
{
mx=0;num=-1;
for(int j=0;j<n;j++)
{
if(x[j]>mx&&!used[j])
{
mx=x[j];
... | 268 |
Project_CodeNet | 2,020 | // By Mohit Gupta
#include <bits/stdc++.h>
using namespace std;
//DEBUG
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL //compile with -DLOCAL
#define debug(...) cerr << "[" << #__VA_... | 749 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
const int MN = 2012;
ll n, a[MN], pos[MN], dp[MN][MN];
int main (void) {
ios::sync_with_stdio(false);cin.tie(0);
cout << fixed << setprecision(15);
cin >> n;
for (int i = 0; i < n; i++) {
cin ... | 349 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define endl "\n"
const int N = 2005;
pair<int, int>a[N];
int cache[N][N];
int n, x;
int ... | 303 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define MOO(i, a, b) for (int i=a; i<b; i++)
#define M00(i, a) for (int i=0; i<a; i++)
#define MOOd(i,a,b) for (int i = (b)-1; i >= a;... | 505 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 498 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ms(x,y) memset(x, y, sizeof(x))
#define lowbit(x) ((x)&(-x))
#define sqr(x) ((x)*(x))
typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
void run_case() {
int n; cin >> n;
vector<pll> a;
for(int i = 1; i <= n; ++i) {
LL t... | 426 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5+100;
const ll mod = 1e9+7;
pair<ll,ll> p[maxn];
ll dp[2100][2100];
int main() {
int n;
cin>>n;
for(int i=1,x;i<=n;i++)
cin>>x,p[i]={x,i};
sort(p+1,p+1+n);
for(int i=1;i<=n;i++)
dp[i][i]=p[1].first*abs... | 230 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)((v).size())
#define fs first
#define sd second
typedef long long ll;
typedef pair < int, int > pi;
typedef pair < pi, int > ppi;
typedef vector < int ... | 700 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>
#include <fstream>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
using namespace ... | 437 |
Project_CodeNet | 2,020 | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <numeric>
#include <cassert>
using namespace std;
typedef vector... | 809 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define dub long double
#define FOR(i, a, b) for (int (i)=(a); (i)<(b); ++(i))
#define ROF(i, a, b) for (int (i)=(a); (i)>(b); --(i))
#define CASET int _T; cin >> _T; FOR(caset, 1, _T+1)
#define pii pair<int,int>
#define t3i tuple<int,int,int>
#defin... | 1,353 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define ndl '\n'
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define up_b upper_bound
#define low_b lower_bound
#define sz(x) (int)x.size()
#define bit __builtin_popcount
#define all(x) x.begin(), x.e... | 654 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i = a;i<=n;++i)
#define per(i,a,n) for (int i = n;i>=a;--i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)x.size())
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = ... | 399 |
Project_CodeNet | 2,020 | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#inclu... | 805 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(in) in.begin(),in.end()
using ll = long long;
using namespace std;
void chmax(ll &a, ll b) { if (a < b) a = b; return; }
using pll = pair<ll,ll>;
int main() {
int n; cin >> n;
vector<pll> a(n); rep(i,n) cin >> a[i].first, a... | 258 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
using namespace std;
int main(){
int N;
cin>>N;
vector<pair<long long,long long>> A(N);
for(int i=0;i<N;i++){
cin>>A[i].first;
A[i].second=i+1;
}
sort(A.begin(),A.end... | 443 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
long long f[2001][2001][2];
int n;
struct node{
long long w;
int id;
}a[2001];
inline bool mycmp(node x,node y){
return x.w>y.w;
}
int main(){
cin>>n;
for(int i=1;i<=n;++i) a[i].id=i,scanf("%lld",&a[i].w);
sort(a+1,a+n+1,mycmp);
for(int i=1;i<=n;++i){
for(int j=0;j<... | 360 |
Project_CodeNet | 2,020 |
#if 1
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <array>
#include <deque>
#include <algorithm>
#include <utility>
#include <cstdint>
#include <functional>
#include ... | 554 |
Project_CodeNet | 2,020 | // https://atcoder.jp/contests/abc163/tasks/abc163_e
#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_popco... | 672 |
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>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF = 1e18;
const int MX = 2005;
ll dp[MX][MX];
inline void chmax(ll& a, ll b) {
a = max(a, b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin ... | 305 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000000000;
ll dp[2005][2005];
int main()
{
ll n;
cin >> n;
P p[2005];
for(int i = 0; i < n; i++){
ll a;
cin >> a;
p[i] = P(a, i);
... | 325 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
const int N = 3005;
int n;
pair<long long, long long> a[N];
long long f[N][N];
long long F(int i, int j)
{
if (i > j)
{
return 0;
}
if (f[i][j] != -1)
{
return f[i][j];
}
int now = j - i + 1;
long long ans = 0;
ans = max... | 326 |
Project_CodeNet | 2,020 | #include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <numeric>
using namespace std;
typedef u... | 563 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | 451 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long dp[2020][2020];
int main() {
int n; cin >> n;
int a[n]; for (int &i : a) cin >> i;
int p[n]; iota(p, p + n, 0);
sort(p, p + n, [&] (int x, int y) {
return a[x] > a[y];
});
for (int l = 0; l < n; l++) {
for (int r = 0; l + r < n; r++) {
int now = l + r... | 264 |
Project_CodeNet | 2,020 | /**
* author: math2do
* created: 20.04.2020 18:08:31 IST
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool smax(T &a, const T &b) {
return a < b ? a = b, true : false;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector <pair <... | 371 |
Project_CodeNet | 2,020 | #include <cassert>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <numeric>
#include <algorithm>
using namespace std;
using lint = long long;
constexpr int MOD = 1000000007, INF = 1010101010;
constex... | 496 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 1,147 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const long long maxn=2005;
typedef long long ll;
int n;
struct Node
{
ll v;
ll id;
}a[maxn];
bool cmp(Node x, Node y)
{
return x.v>y.v;
}
ll f[maxn],g[maxn];
int main()
{
cin>>n;
for(int i=1;i<=... | 373 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, int>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do... | 628 |
Project_CodeNet | 2,020 | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define deb(x) cout << #x << " " << x << endl;
#define N 2005
typedef long long int ll;
typedef vector<pair<int, int>> vpi;
typedef unordered_map<int, unordered_map<int, int>> ump;
ll dp... | 357 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
// macro
#define rep(i,n) for(i=0;i<n;i++)
#define ll long long
#define all(v) v.begin(), v.end()
// code starts
int main()
{
ll n;cin>>n;
vector<int> a(n);
ll i,j;
rep(i,n)cin>>a[i];
vector<pair<ll,ll>> p(n);
rep(i,n)p[i]=make_pair(a[i],i);
sort(all(p));
reverse(a... | 337 |
Project_CodeNet | 2,020 | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <numeric>
#include <map>
#include <iomanip>
#include <limits.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const bool DEBUG = ... | 450 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define pp push_back
#define pf push_front
#define mp make_pair
#define fs first
#define sc second
#define sf scanf
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = (int) 2e3;
const int INF = (int) 1e9 + 7;
ii p[N + 7];
ll ... | 334 |
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)
#define all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cer... | 895 |
Project_CodeNet | 2,020 | // Sky's the limit :)
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
//int t; cin >> t; while(t--)
{
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(... | 278 |
Project_CodeNet | 2,020 | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <cassert>
#include <random>
long long chmax(long long &a, long lo... | 381 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
using VVL = vector< vector <long long> >;
using VP = vector < pair<long long, int> >;
long long solve(VV... | 407 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define repi(n) for (int i = 0; i < (n); i++)
#define repj(n) for (int j = 0; j < (n); j++)
#define repk(n) for (int k = 0; k < (n); k++)
#define repl(n) for (int l = 0; l < (n); l++)
#define rep(i, n) for (int i = 0; (i) < (n); i++)
#define repr(i, a... | 2,335 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#include <algorithm>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<pair<ll, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i;
}
s... | 339 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scanin... | 682 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
#define pi 3.141592653589793
#define mod 998244353
#define pb push_back
#defin... | 511 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[... | 436 |
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 ll long long
int main() {
int N;
cin >> N;
vector<pair<ll, int>> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first;
A[i].second = i;
}
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
vector<vector<ll>> dp(N... | 314 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define nl '\n'
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int , int> pi;
void solve()
{
int n;
cin>>n;
vector<pi> a(n);
for(int i=0; i<n; i++)
{
cin>>a[i].F;
a[i].S = i;
... | 364 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
typedef long long ll;
const int N=2e5+5;
const int p=1e9+7;
#define PI acos(-1)
ll qpow(ll a,ll n){ll res=1;while(n){if(n&1)res=res*a%p;a=a*a%p;n>>=1;}return res;}
struct node{
ll v;
int id;
}a[2005];
ll dp[2005][2005];
bool cmp(no... | 431 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <string>
#include <string.h>
#include <math.h>
#include <iomanip>
#include <stdio.h>
using namespace std;
#define int64 long long
#define pii pair <int64, int64>
#define fr first
#define ... | 476 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
long long a[10005];
long long dp[10005];
struct poi
{
long long zhi;
int wz;
}p[100005];
bool cmp(poi a,poi b)
{
return a.zhi>b.zhi;
}
int main(){
int n,i,j;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
p[i].zhi=a[i];... | 306 |
Project_CodeNet | 2,020 |
// Problem : E - Active Infants
// Contest : AtCoder - AtCoder Beginner Contest 163
// URL : https://atcoder.jp/contests/abc163/tasks/abc163_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.h... | 683 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a; i< (int)(b); ++i)
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
typedef long double ld;
using ll=long long;
using namespace std;
const int mod=1e9+7;
const ld pi = (acos(-1));
template<class T>bool chmax(T &a, const T &b) { if (a<b)... | 367 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) (v).begin(),(v).end()
#define debug(x) cout << #x << '=' << x << '\n'
const long long MOD=1e9+7;
//const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
const... | 552 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.