제출 #131193

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
131193		zubec	ICC (CEOI16_icc)	C++14	100 / 100	153 ms	632 KiB

icc

#include "icc.h"
#include <bits/stdc++.h>
using namespace std;


int n;

int sz1, sz2, A[110], B[110];

int my_query(vector<int> &vec1, vector <int> &vec2){
    sz1 = sz2 = 0;
    for (int i = 0; i < vec1.size(); i++)
        A[sz1++] = vec1[i];
    for (int i = 0; i < vec2.size(); i++)
        B[sz2++] = vec2[i];
    return query(sz1, sz2, A, B);
}

int dsu[110];

int dsu_get(int v){
    if (v == dsu[v])
        return v;
    return dsu[v] = dsu_get(dsu[v]);
}

void dsu_unite(int a, int b){
    a = dsu_get(a);
    b = dsu_get(b);
    dsu[b] = a;
}

vector <int> g[110];

void run(int N){
    n = N;
    for (int i = 1; i <= n; i++){
        dsu[i] = i;
    }
    for (int tt = 1; tt < n; tt++){
        vector <int> vec;
        for (int i = 1; i <= n; i++)
            g[i].clear();
        for (int i = 1; i <= n; i++){
            vec.push_back(dsu_get(i));
            g[dsu_get(i)].push_back(i);
        }
        sort(vec.begin(), vec.end());
        vec.erase(unique(vec.begin(), vec.end()), vec.end());
        int mask = 0;
        int lst = 0;
        int sz = 0;
        for (int bt = 0; ; bt++){
            vector <int> vec1, vec2;
            for (int j = 0; j < vec.size(); j++){
                if (j & (1<<bt)){
                    for (int l = 0; l < g[vec[j]].size(); l++)
                        vec1.push_back(g[vec[j]][l]);
                } else {
                    for (int l = 0; l < g[vec[j]].size(); l++)
                        vec2.push_back(g[vec[j]][l]);
                }
            }
            if (vec1.empty() || vec2.empty())
                break;
            sz = bt;
            if (my_query(vec1, vec2)){
                mask |= (1<<bt);
                lst = bt;
            }
        }
        int mask1 = 0, mask2 = (1<<lst);
        for (int bt = sz; bt >= 0; bt--){
            if (bt == lst)
                continue;
            if (mask & (1<<bt)){
                vector <int> vec1, vec2;
                for (int j = 0; j < vec.size(); j++){
                    if ((j & (1<<bt)) && (j & (1<<lst))){
                        for (int l = 0; l < g[vec[j]].size(); l++)
                            vec1.push_back(g[vec[j]][l]);
                    } else
                    if (!(j & (1<<bt)) && !(j & (1<<lst))){
                        for (int l = 0; l < g[vec[j]].size(); l++)
                            vec2.push_back(g[vec[j]][l]);
                    }
                }
                if (vec1.empty() || vec2.empty() || !my_query(vec1, vec2))
                    mask1 |= (1<<bt); else
                    mask2 |= (1<<bt);
            } else {
                vector <int> vec1, vec2;
                for (int j = 0; j < vec.size(); j++){
                    if (!(j & (1<<bt)) && (j & (1<<lst))){
                        for (int l = 0; l < g[vec[j]].size(); l++)
                            vec1.push_back(g[vec[j]][l]);
                    } else
                    if (!(j & (1<<bt)) && !(j & (1<<lst))){
                        for (int l = 0; l < g[vec[j]].size(); l++)
                            vec2.push_back(g[vec[j]][l]);
                    }
                }
                if (vec1.empty() || vec2.empty() || !my_query(vec1, vec2)){
                    mask1 |= (1<<bt);
                    mask2 |= (1<<bt);
                }
            }
        }
        vector <int> vec1 = g[vec[mask1]], vec2 = g[vec[mask2]];

        int l = 0, r = vec1.size()-1;
        while(l < r){
            int mid = (l+r)>>1;
            vector <int> cur;
            for (int j = l; j <= mid; j++)
                cur.push_back(vec1[j]);
            if (my_query(cur, vec2))
                r = mid; else
                l = mid+1;
        }
        int a = vec1[l];
        l = 0, r = vec2.size()-1;
        while(l < r){
            int mid = (l+r)>>1;
            vector <int> cur;
            for (int j = l; j <= mid; j++)
                cur.push_back(vec2[j]);
            if (my_query(vec1, cur))
                r = mid; else
                l = mid+1;
        }
        int b = vec2[l];
        setRoad(a, b);
        dsu_unite(a, b);
    }
}


/**

4
2 4
1 3
1 4

*/

컴파일 시 표준 에러 (stderr) 메시지

icc.cpp: In function 'int my_query(std::vector<int>&, std::vector<int>&)':
icc.cpp:12:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < vec1.size(); i++)
                     ~~^~~~~~~~~~~~~
icc.cpp:14:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < vec2.size(); i++)
                     ~~^~~~~~~~~~~~~
icc.cpp: In function 'void run(int)':
icc.cpp:55:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int j = 0; j < vec.size(); j++){
                             ~~^~~~~~~~~~~~
icc.cpp:57:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for (int l = 0; l < g[vec[j]].size(); l++)
                                     ~~^~~~~~~~~~~~~~~~~~
icc.cpp:60:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for (int l = 0; l < g[vec[j]].size(); l++)
                                     ~~^~~~~~~~~~~~~~~~~~
icc.cpp:78:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int j = 0; j < vec.size(); j++){
                                 ~~^~~~~~~~~~~~
icc.cpp:80:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for (int l = 0; l < g[vec[j]].size(); l++)
                                         ~~^~~~~~~~~~~~~~~~~~
icc.cpp:84:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for (int l = 0; l < g[vec[j]].size(); l++)
                                         ~~^~~~~~~~~~~~~~~~~~
icc.cpp:93:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int j = 0; j < vec.size(); j++){
                                 ~~^~~~~~~~~~~~
icc.cpp:95:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for (int l = 0; l < g[vec[j]].size(); l++)
                                         ~~^~~~~~~~~~~~~~~~~~
icc.cpp:99:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for (int l = 0; l < g[vec[j]].size(); l++)
                                         ~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 22 / 22
• Subtask 4: 21 / 21
• Subtask 5: 29 / 29
• Subtask 6: 10 / 10