# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014477 | bachhoangxuan | Archery (IOI09_archery) | C++17 | 765 ms | 18516 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>
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n,R;cin >> n >> R;R=R%n+2*n;
vector<int> b(2*n),a(2*n);
vector<vector<int>> cnt(n,vector<int>(3,0));
for(int i=0;i<2*n;i++) cin >> b[i];
int s=b[0];
auto g = [&](int x){
return (x>s)+(x>=s);
};
auto f = [&](){
if(s==1) return 0;
cnt.assign(n,vector<int>(3,0));
if(s>n+1){
int pos=0;
for(int i=0;i<n;i++){
cnt[i][0]=(a[i]>s)+(a[n+i]>s);
cnt[i][1]=(a[i]==s || a[n+i]==s);
}
int x=0,y=0,rt=0;
for(int it=0;it<3;it++){
int i=0;
do{
auto &d=cnt[i];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |