Submission #271654

# Submission time Handle Problem Language Result Execution time Memory
271654 2020-08-18T07:09:11 Z 최은수(#5096) Archery (IOI09_archery) C++17
20 / 100
54 ms 11692 KB
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
bool chk[200010];
int pa[200010];
int n;
int par(int x)
{
    if(!chk[x])
        return x;
    return pa[x]=par(pa[x]);
}
inline void put(int x)
{
    chk[x]=1;
    pa[x]=x==1?n:x-1;
    return;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int r;
    cin>>n>>r;
    r=(r-n*2)%n+n*2;
    int s;
    cin>>s;
    vector<int>p(n*2-1);
    for(int&t:p)
        cin>>t;
    if(n<=200)
    {
        int mx=inf,mi=-1;
        for(int i=n;i>0;i--)
        {
            vector<pi>v(n+1);
            for(int j=1;j<i;j++)
                v[j]=pi(p[j*2-2],p[j*2-1]);
            v[i]=pi(s,p[i*2-2]);
            for(int j=i;j++<n;)
                v[j]=pi(p[j*2-3],p[j*2-2]);
            for(int j=0;j<r;j++)
            {
                for(int k=1;k++<n;)
                    if(v[k].fi<v[k].se)
                        swap(v[k].fi,v[k].se);
                if(v[1].fi>v[1].se)
                    swap(v[1].fi,v[1].se);
                for(int k=0;k<n;k++)
                    v[k].se=v[k+1].se;
                v[n].se=v[0].se;
            }
            int id=-1;
            for(int j=0;j++<n;)
                if(v[j].fi==s||v[j].se==s)
                    id=j;
            if(id<mx)
                mx=id,mi=i;
        }
        cout<<mi<<endl;
        return 0;
    }
    if(s>1&&s<n+2)
        return cout<<r%n+1<<endl,0;
    int mx=inf,mi=-1;
    for(int i=n;i>0;i--)
    {
        vector<pi>v(n+1);
        for(int j=1;j<i;j++)
            v[j]=pi(p[j*2-2],p[j*2-1]);
        v[i]=pi(s,p[i*2-2]);
        for(int j=i;j++<n;)
            v[j]=pi(p[j*2-3],p[j*2-2]);
        vector<int>pos(n*2+1);
        for(int j=0;j++<n;)
            pos[v[j].fi]=pos[v[j].se]=j;
        fill(chk,chk+n+1,0);
        if(s!=1)
        {
            chk[pos[1]]=1;
            for(int j=n*2;j>s;put(pos[j]))
                pos[j]=par(pos[j]);
            pos[s]=par(pos[s]);
        }
        if(pos[s]<mx)
            mx=pos[s],mi=i;
        if(mx==1)
            break;
    }
    cout<<mi<<endl;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 22 ms 384 KB Output isn't correct
3 Correct 5 ms 384 KB Output is correct
4 Incorrect 1 ms 384 KB Output isn't correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 29 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 38 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Incorrect 3 ms 512 KB Output isn't correct
5 Incorrect 40 ms 1664 KB Output isn't correct
6 Correct 29 ms 384 KB Output is correct
7 Incorrect 1 ms 384 KB Output isn't correct
8 Incorrect 4 ms 512 KB Output isn't correct
9 Incorrect 4 ms 544 KB Output isn't correct
10 Incorrect 1 ms 384 KB Output isn't correct
11 Incorrect 4 ms 512 KB Output isn't correct
12 Incorrect 1 ms 384 KB Output isn't correct
13 Incorrect 25 ms 1280 KB Output isn't correct
14 Incorrect 1 ms 384 KB Output isn't correct
15 Incorrect 8 ms 640 KB Output isn't correct
16 Correct 36 ms 384 KB Output is correct
17 Incorrect 1 ms 384 KB Output isn't correct
18 Incorrect 1 ms 384 KB Output isn't correct
19 Incorrect 1 ms 416 KB Output isn't correct
20 Incorrect 1 ms 384 KB Output isn't correct
21 Incorrect 4 ms 512 KB Output isn't correct
22 Incorrect 6 ms 640 KB Output isn't correct
23 Incorrect 40 ms 1792 KB Output isn't correct
24 Correct 37 ms 384 KB Output is correct
25 Runtime error 1 ms 640 KB Execution killed with signal 11
26 Runtime error 2 ms 768 KB Execution killed with signal 11
27 Runtime error 6 ms 1664 KB Execution killed with signal 11
28 Runtime error 33 ms 6912 KB Execution killed with signal 11
29 Runtime error 2 ms 640 KB Execution killed with signal 11
30 Runtime error 2 ms 768 KB Execution killed with signal 11
31 Runtime error 8 ms 1664 KB Execution killed with signal 11
32 Runtime error 49 ms 9720 KB Execution killed with signal 11
33 Correct 38 ms 384 KB Output is correct
34 Correct 31 ms 384 KB Output is correct
35 Runtime error 1 ms 640 KB Execution killed with signal 11
36 Runtime error 2 ms 640 KB Execution killed with signal 11
37 Runtime error 5 ms 1536 KB Execution killed with signal 11
38 Runtime error 7 ms 2048 KB Execution killed with signal 11
39 Correct 30 ms 384 KB Output is correct
40 Runtime error 1 ms 640 KB Execution killed with signal 11
41 Runtime error 1 ms 640 KB Execution killed with signal 11
42 Runtime error 2 ms 640 KB Execution killed with signal 11
43 Runtime error 2 ms 896 KB Execution killed with signal 11
44 Runtime error 3 ms 1024 KB Execution killed with signal 11
45 Runtime error 6 ms 1664 KB Execution killed with signal 11
46 Runtime error 7 ms 1664 KB Execution killed with signal 11
47 Runtime error 54 ms 11692 KB Execution killed with signal 11