# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086085 | Bananabread | Council (JOI23_council) | C++17 | 4030 ms | 30352 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll int
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "temp"
#define frep freopen("03-06.inp","r",stdin); freopen(taskname".out","w",stdout);
using namespace std;
ll pref[300001];
ll arr[300001][21];
ll ans[300001];
ll cnt[1<<14]={};
ll best[1<<14]={};
ll n,m;
void sub2(){
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
ll cnt=0;
for(int u=1;u<=m;u++){
ll c=pref[u]-arr[i][u]-arr[j][u];
if(c>n/2-1) cnt++;
}
ans[i]=max(ans[i],cnt);
ans[j]=max(ans[j],cnt);
}
}
for(int i=1;i<=n;i++){
cout<<ans[i]<<ntr;
}
}
bool ison(ll x,ll bit){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |