oj.uz

답안 #986303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
986303 2024-05-20T09:25:21 Z AlphaMale06 CEOI16_icc (CEOI16_icc) C++17
90 / 100
 86 ms 1104 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;

int query(int n, int m, int a[], int b[]);
void setRoad(int a, int b);

const int N = 101;

int p[N], sz[N];
vector<int> comp[N];

int find(int v){
    if(p[v]==v)return v;
    return p[v]=find(p[v]);
}

void merge(int v, int u){
    v=find(v);
    u=find(u);
    if(u==v)return;
    p[v]=u;
    sz[u]+=sz[v];
    for(int e : comp[v])comp[u].push_back(e);
}

void run(int n){
    for(int i=1; i<=n; i++){
        p[i]=i;
        sz[i]=1;
        comp[i].push_back(i);
    }
    for(int i=0; i< n-1; i++){
        set<int> st;
        for(int j=1; j<=n; j++)st.insert(find(j));
        vector<int> a;
        for(auto p : st)a.push_back(p);
        vector<int> st1, st2;
        for(int j=0; j<7; j++){
            for(int k=0; k<a.size(); k++){
                int x = k>>j;
                if(x&1){
                    for(int e : comp[a[k]])st1.push_back(e);
                }
                else{
                    for(int e : comp[a[k]])st2.push_back(e);
                }
            }
            int sz1=st1.size(), sz2=st2.size();
            int fst[sz1], scd[sz2];
            for(int i=0; i< sz1; i++)fst[i]=st1[i];
            for(int i=0; i< sz2; i++)scd[i]=st2[i];
            if(query(sz1, sz2, fst, scd))break;
            st1.clear(); st2.clear();
        }
        vector<int> nscd = st2;
        int sz1 = st1.size();
        int fst[sz1];
        for(int i=0; i< sz1; i++)fst[i]=st1[i];
        while(nscd.size()>1){
            int sz = nscd.size()/2;
            int scd[sz];
            for(int i=0; i< sz; i++)scd[i]=nscd[i];
            if(query(sz1, sz, fst, scd)){
                while(nscd.size()>sz)nscd.pop_back();
            }
            else{
                reverse(nscd.begin(), nscd.end());
                for(int i=0; i<sz; i++)nscd.pop_back();
                reverse(nscd.begin(), nscd.end());
            }
        }
        int scd[1] = {nscd[0]};
        vector<int> nfst = st1;
        while(nfst.size()>1){
            int sz=nfst.size()/2;
            int fst[sz];
            for(int i=0; i< sz; i++)fst[i]=nfst[i];
            if(query(sz, 1, fst, scd)){
                while(nfst.size()>sz)nfst.pop_back();
            }
            else{
                reverse(nfst.begin(), nfst.end());
                for(int i=0; i< sz; i++)nfst.pop_back();
                reverse(nfst.begin(), nfst.end());
            }
        }
        setRoad(nfst[0], nscd[0]);
        merge(max(nfst[0], nscd[0]), min(nscd[0], nfst[0]));
    }
}

Compilation message

icc.cpp: In function 'void run(int)':
icc.cpp:40:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |             for(int k=0; k<a.size(); k++){
      |                          ~^~~~~~~~~
icc.cpp:65:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   65 |                 while(nscd.size()>sz)nscd.pop_back();
      |                       ~~~~~~~~~~~^~~
icc.cpp:80:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   80 |                 while(nfst.size()>sz)nfst.pop_back();
      |                       ~~~~~~~~~~~^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 600 KB Ok! 96 queries used.
2 Correct 4 ms 604 KB Ok! 99 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 600 KB Ok! 533 queries used.
2 Correct 26 ms 640 KB Ok! 680 queries used.
3 Correct 28 ms 604 KB Ok! 667 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 1104 KB Ok! 1418 queries used.
2 Correct 79 ms 604 KB Ok! 1641 queries used.
3 Correct 75 ms 604 KB Ok! 1605 queries used.
4 Correct 77 ms 632 KB Ok! 1539 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 600 KB Ok! 1505 queries used.
2 Correct 73 ms 600 KB Ok! 1505 queries used.
3 Correct 79 ms 636 KB Ok! 1649 queries used.
4 Correct 71 ms 644 KB Ok! 1489 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 632 KB Ok! 1636 queries used.
2 Correct 86 ms 640 KB Ok! 1656 queries used.
3 Correct 80 ms 600 KB Ok! 1666 queries used.
4 Correct 81 ms 600 KB Ok! 1624 queries used.
5 Correct 71 ms 640 KB Ok! 1495 queries used.
6 Correct 77 ms 600 KB Ok! 1580 queries used.

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 81 ms 600 KB Too many queries! 1669 out of 1625
2 Halted 0 ms 0 KB -