oj.uz

Submission #986096

# Submission time Handle Problem Language Result Execution time Memory
986096 2024-05-19T17:56:11 Z alexdd ICC (CEOI16_icc) C++17
61 / 100
 161 ms 856 KB 
#include "icc.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(219348);
int n;
vector<int> comps[105];
int unde[105];
vector<int> ord,ord2;
int aska[105],askb[105],sa,sb;
int wirtz(int poz)
{
    sa=sb=0;
    for(int i=0;i<=poz;i++)
        for(auto x:comps[ord[i]])
            aska[sa++]=x;
    for(int i=poz+1;i<ord.size();i++)
        for(auto x:comps[ord[i]])
            askb[sb++]=x;
    return query(sa,sb,aska,askb);
}
int boniface(int c1, int poz1, int c2)
{
    sa=sb=0;
    for(int i=0;i<=poz1;i++)
        aska[sa++]=comps[c1][i];
    for(auto x:comps[c2])
        askb[sb++]=x;
    return query(sa,sb,aska,askb);
}
int frimpong(int le1, int ri1, int le2, int ri2)
{
    sa=sb=0;
    for(int i=le1;i<=ri1;i++)
        aska[sa++]=ord2[i];
    for(int i=le2;i<=ri2;i++)
        askb[sb++]=ord2[i];
    return query(sa,sb,aska,askb);
}
void run(int N)
{
    n=N;
    for(int i=1;i<=n;i++)
    {
        ord.push_back(i);
        comps[i].push_back(i);
        unde[i]=i;
    }
    for(int pas=1;pas<n;pas++)
    {
        do
        {
            shuffle(ord.begin(),ord.end(),rnd);
        }while(!wirtz((int)ord.size()/2-1));
        ord2.clear();
        for(auto c:ord)
        {
            shuffle(comps[c].begin(),comps[c].end(),rnd);
            for(auto x:comps[c])
                ord2.push_back(x);
        }
        int aux=0;
        for(int i=0;i<=(int)ord.size()/2-1;i++)
            aux += (int)comps[ord[i]].size();
        int st,dr,ans;
        st=aux;
        dr=(int)ord2.size()-2;
        ans=(int)ord2.size()-1;
        while(dr-st+1>3)
        {
            int mij=(st+dr)/2;
            if(frimpong(0,aux-1,aux,mij))
            {
                ans=mij;
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        for(int i=st;i<=dr;i++)
        {
            if(frimpong(0,aux-1,aux,i))
            {
                ans=i;
                break;
            }
        }
        int vri = ord2[ans];

        st=0;
        dr=aux-2;
        ans=aux-1;
        while(dr-st+1>3)
        {
            int mij=(st+dr)/2;
            if(frimpong(0,mij,aux,(int)ord2.size()-1))
            {
                ans=mij;
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        for(int i=st;i<=dr;i++)
        {
            if(frimpong(0,i,aux,(int)ord2.size()-1))
            {
                ans=i;
                break;
            }
        }
        int vle = ord2[ans];

        setRoad(vle,vri);

        int cle=unde[vle],cri=unde[vri];
        for(auto x:comps[cri])
        {
            comps[cle].push_back(x);
            unde[x]=cle;
        }
        comps[cri].clear();
        shuffle(comps[cle].begin(),comps[cle].end(),rnd);
        bool sters=0;
        for(int i=0;i<ord.size();i++)
        {
            if(ord[i]==cri)
            {
                sters=1;
                ord.erase(ord.begin()+i);
                break;
            }
        }
    }
}

Compilation message

icc.cpp: In function 'int wirtz(int)':
icc.cpp:16:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for(int i=poz+1;i<ord.size();i++)
      |                     ~^~~~~~~~~~~
icc.cpp: In function 'void run(int)':
icc.cpp:124:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |         for(int i=0;i<ord.size();i++)
      |                     ~^~~~~~~~~~~
icc.cpp:123:14: warning: variable 'sters' set but not used [-Wunused-but-set-variable]
  123 |         bool sters=0;
      |              ^~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 604 KB Ok! 116 queries used.
2 Correct 9 ms 604 KB Ok! 129 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 600 KB Ok! 560 queries used.
2 Correct 39 ms 600 KB Ok! 845 queries used.
3 Correct 38 ms 616 KB Ok! 817 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 101 ms 604 KB Ok! 1570 queries used.
2 Correct 141 ms 604 KB Ok! 2153 queries used.
3 Correct 161 ms 856 KB Ok! 1726 queries used.
4 Correct 126 ms 620 KB Ok! 1765 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 600 KB Ok! 1696 queries used.
2 Correct 161 ms 632 KB Ok! 1663 queries used.
3 Correct 118 ms 636 KB Ok! 1864 queries used.
4 Correct 122 ms 616 KB Ok! 1586 queries used.

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 122 ms 636 KB Too many queries! 1924 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

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