競技プログラミング
C++を想定
| 順位 | 名前 | スコア | 称号 | 打鍵/秒 | 正誤率 | 時間(秒) | 打鍵数 | ミス | 問題 | 日付 |
|---|---|---|---|---|---|---|---|---|---|---|
| 1 | ku | 4088 | 青 | 4.0 | 100% | 90.0 | 368 | 0 | 25 | 2024/06/15 |
問題文
(cin >> n;)
cin >> n;
(for(ll i=0;i<n;i++))
for(ll i=0;i<n;i++)
(ans = n * (n - 1) / 2;)
ans = n * (n - 1) / 2;
(cin >> x[i] >> y[i];)
cin >> x[i] >> y[i];
(z[i] = ans;)
z[i] = ans;
(return 0;)
return 0;
(if(s[i] == 'B'))
if(s[i] == 'B')
(p(ans);)
p(ans);
(ans %= mod;)
ans %= mod;
(sort(x,x+n);)
sort(x,x+n);
(cin >> n;)
cin >> n;
(pe(x[i]);)
pe(x[i]);
(el;)
el;
(sort(table,table+n);)
sort(table,table+n);
(cin >> a >> b;)
cin >> a >> b;
(for(ll j=0;j<n;j++))
for(ll j=0;j<n;j++)
(ll idx = 0;)
ll idx = 0;
(pql.push(x[i]);)
pql.push(x[i]);
(pql.pop();)
pql.pop();
(while(1))
while(1)
(bool flag = false;)
bool flag = false;
(ll nv = G[v][i];)
ll nv = G[v][i];
(if(dp[i][j]))
if(dp[i][j])
(dp[0][j] += (1ll << j);)
dp[0][j] += (1ll << j);
(a = max(a,x[i]);)
a = max(a,x[i]);
(a += x[i];)
a += x[i];
(G[a].pb(b);)
G[a].pb(b);
(ll root = -1;)
ll root = -1;
(cin >> n >> m >> k;)
cin >> n >> m >> k;
(q.pop();)
q.pop();
(while(ok - ng > 1))
while(ok - ng > 1)
(cost[i] = INF;)
cost[i] = INF;
(rv[i] = vsum + v[i];)
rv[i] = vsum + v[i];
(ll w[500005];)
ll w[500005];
(p(n+m/num);)
p(n+m/num);
(if(a[0]!=0)flag=true;)
if(a[0]!=0)flag=true;
(a[n]=0;)
a[n]=0;
(if(a[i]<a[i+1])continue;)
if(a[i]<a[i+1])continue;
(p(-1);)
p(-1);
(l--;)
l--;
(flag = true;)
flag = true;
(if(!flag)break;)
if(!flag)break;
(ll ban[50][50];)
ll ban[50][50];
(ans += res;)
ans += res;
(res = 0;)
res = 0;
(ans += 2 * k;)
ans += 2 * k;
(ans = min(ans, n - 1);)
ans = min(ans, n - 1);
(if(s[i] == s[i+1]))
if(s[i] == s[i+1])
(ans += min(x[i], x[i+1]);)
ans += min(x[i], x[i+1]);
(ans = x[0] + x[n - 2];)
ans = x[0] + x[n - 2];
(sort(v.begin(),v.end());)
sort(v.begin(),v.end());
(vector <ll> v;)
vector <ll> v;
(ll largest = v[0];)
ll largest = v[0];
(ll a = 0,b = 1;)
ll a = 0,b = 1;
(lb(v.begin(),v.end(),-INF);)
lb(v.begin(),v.end(),-INF);
(reside = (reside + d) % d;)
reside = (reside + d) % d;
(ll move = (sum_1 - reside) / d;)
ll move = (sum_1 - reside) / d;
(get<0>(table[n+1]) = d + 100;)
get<0>(table[n+1]) = d + 100;
(get<1>(table[n+1]) = -1;)
get<1>(table[n+1]) = -1;