oj.uz

Submission #580959

# Submission time Handle Problem Language Result Execution time Memory
580959 2022-06-22T06:56:51 Z andrei_boaca ICC (CEOI16_icc) C++14
61 / 100
 164 ms 628 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
mt19937 rng(time(NULL));
int n;
vector<int> dsu[105];
int comp[105],a[105],b[105],asize,bsize,A[105];
int comps[105][105],vals[105];
void dsu_merge(int c1,int c2)
{
    if(dsu[c1].size()<dsu[c2].size())
        swap(c1,c2);
    for(int i:dsu[c2])
    {
        comp[i]=c1;
        dsu[c1].push_back(i);
    }
    dsu[c2].clear();
}
int adj[105][105];
/*int query(int asize,int bsize, int v[105],int w[105])
{
    for(int i=0;i<asize;i++)
        for(int j=0;j<bsize;j++)
            if(adj[v[i]][w[j]])
                return 1;
    return 0;
}
void setRoad(int x,int y)
{
    cout<<x<<' '<<y<<'\n';
    adj[x][y]=adj[y][x]=1;
}*/
void run(int N)
{
    n=N;
    for(int i=1;i<=n;i++)
    {
        dsu[i].push_back(i);
        comp[i]=i;
    }
    int nr=n;
    for(int z=1;z<n;z++,nr--)
    {
        int cnt=0;
        /*int h,e;
        cin>>h>>e;
        adj[h][e]=adj[e][h]=1;*/
        for(int i=1;i<=n;i++)
            if(dsu[i].size())
            {
                cnt++;
                for(int j:dsu[i])
                    comp[j]=cnt;
                dsu[cnt]=dsu[i];
                if(i!=cnt)
                    dsu[i].clear();
            }
        for(int i=1;i<=cnt;i++)
            vals[i]=i;
        int mid=(cnt+1)/2;
        int nr=20;
        while(nr--)
        {
            asize=0;
            for(int i=1;i<=mid;i++)
                for(int q:dsu[vals[i]])
                    a[asize++]=q;
            bsize=0;
            for(int i=mid+1;i<=cnt;i++)
                for(int q:dsu[vals[i]])
                    b[bsize++]=q;
            if(query(asize,bsize,a,b))
                break;
            shuffle(vals+1,vals+cnt+1,rng);
        }
        int st=0;
        int dr=asize-1;
        int x=0;
        shuffle(a,a+asize,rng);
        while(st<=dr)
        {
            int mij=(st+dr)/2;
            int sza=0;
            for(int i=0;i<=mij;i++)
                A[sza++]=a[i];
            int ans=query(sza,bsize,A,b);
            if(ans==1)
            {
                x=a[mij];
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        st=0;
        dr=bsize-1;
        int y=0;
        shuffle(b,b+bsize,rng);
        while(st<=dr)
        {
            int mij=(st+dr)/2;
            int sza=0;
            for(int i=0;i<=mij;i++)
                A[sza++]=b[i];
            int ans=query(sza,asize,A,a);
            if(ans==1)
            {
                y=b[mij];
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        dsu_merge(comp[x],comp[y]);
        setRoad(x,y);
    }
}
/*int main()
{
    int N;
    cin>>N;
    run(N);
}*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Ok! 108 queries used.
2 Correct 8 ms 468 KB Ok! 110 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 468 KB Ok! 557 queries used.
2 Correct 49 ms 492 KB Ok! 849 queries used.
3 Correct 42 ms 588 KB Ok! 818 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 528 KB Ok! 1487 queries used.
2 Correct 164 ms 492 KB Ok! 2159 queries used.
3 Correct 117 ms 504 KB Ok! 1579 queries used.
4 Correct 131 ms 496 KB Ok! 1706 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 496 KB Ok! 1685 queries used.
2 Correct 132 ms 628 KB Ok! 1561 queries used.
3 Correct 144 ms 488 KB Ok! 1893 queries used.
4 Correct 107 ms 500 KB Ok! 1453 queries used.

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 148 ms 500 KB Too many queries! 1915 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 149 ms 500 KB Too many queries! 1930 out of 1625
2 Halted 0 ms 0 KB -