oj.uz

Submission #271820

# Submission time Handle Problem Language Result Execution time Memory
271820 2020-08-18T07:38:22 Z 최은수(#5096) Archery (IOI09_archery) C++17
68 / 100
 1412 ms 6516 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<=500)
    {
        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)
    {
        if(n>10000)
            return cout<<n<<endl,0;
        int mx=inf,mi=-1;
        for(int i=n;i>max(0,n-200000000/n/n);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;
    }
    int mx=inf,mi=-1;
    int ps=-1;
    {
        int i=n;
        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)
        {
            put(pos[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;
        ps=1;
        while(chk[ps])
            ps++;
    }
    for(int i=n;i>n-30;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)
        {
            put(pos[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;
    }
    for(int i=min(ps+5000000/n,n);i>max(ps-10000000/n,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)
        {
            put(pos[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||i>mi)
            mx=pos[s],mi=i;
    }
    cout<<mi<<endl;
    return 0;
}

Subtask #1
4.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 24 ms 384 KB Output isn't correct
3 Correct 8 ms 384 KB Output is correct
4 Incorrect 984 ms 420 KB Output isn't correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 37 ms 384 KB Output is correct

Subtask #2
64.0 / 94.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 66 ms 392 KB Output is correct
3 Incorrect 923 ms 416 KB Output isn't correct
4 Incorrect 5 ms 512 KB Output isn't correct
5 Correct 46 ms 1664 KB Output is correct
6 Correct 39 ms 384 KB Output is correct
7 Incorrect 618 ms 508 KB Output isn't correct
8 Incorrect 5 ms 512 KB Output isn't correct
9 Correct 6 ms 512 KB Output is correct
10 Incorrect 728 ms 404 KB Output isn't correct
11 Incorrect 5 ms 512 KB Output isn't correct
12 Incorrect 650 ms 432 KB Output isn't correct
13 Incorrect 23 ms 1280 KB Output isn't correct
14 Incorrect 975 ms 476 KB Output isn't correct
15 Incorrect 7 ms 640 KB Output isn't correct
16 Correct 57 ms 384 KB Output is correct
17 Correct 866 ms 408 KB Output is correct
18 Incorrect 814 ms 504 KB Output isn't correct
19 Correct 908 ms 384 KB Output is correct
20 Correct 974 ms 504 KB Output is correct
21 Incorrect 4 ms 512 KB Output isn't correct
22 Correct 6 ms 640 KB Output is correct
23 Incorrect 39 ms 1792 KB Output isn't correct
24 Correct 46 ms 384 KB Output is correct
25 Correct 34 ms 384 KB Output is correct
26 Correct 252 ms 512 KB Output is correct
27 Correct 892 ms 1140 KB Output is correct
28 Incorrect 1117 ms 4328 KB Output isn't correct
29 Correct 74 ms 384 KB Output is correct
30 Correct 225 ms 608 KB Output is correct
31 Correct 798 ms 1108 KB Output is correct
32 Correct 1412 ms 5528 KB Output is correct
33 Correct 60 ms 396 KB Output is correct
34 Correct 42 ms 384 KB Output is correct
35 Correct 114 ms 452 KB Output is correct
36 Correct 190 ms 464 KB Output is correct
37 Incorrect 729 ms 980 KB Output isn't correct
38 Correct 811 ms 1232 KB Output is correct
39 Correct 60 ms 384 KB Output is correct
40 Correct 33 ms 384 KB Output is correct
41 Correct 163 ms 452 KB Output is correct
42 Correct 157 ms 464 KB Output is correct
43 Correct 698 ms 536 KB Output is correct
44 Correct 621 ms 840 KB Output is correct
45 Correct 723 ms 1176 KB Output is correct
46 Correct 679 ms 1096 KB Output is correct
47 Correct 1326 ms 6516 KB Output is correct