oj.uz

답안 #918834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
918834 2024-01-30T13:48:16 Z vjudge1 CEOI16_icc (CEOI16_icc) C++17
100 / 100
 90 ms 888 KB 
#include "icc.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pii pair<int, int>
#define oo 1e9
 
vector<vector<int>> comps;
 
int n;
 
void f(vector<int> a, vector<int>& b){
    while(b.size() != 1){
        vector<int> tmp;
        for(int i = 0; i <= (b.size() - 1) / 2; i++){
            tmp.push_back(b[i]);
        }
        if(query(a.size(), tmp.size(), a.data(), tmp.data())){
            b = tmp;
        }
        else{
            for(int i = 0; i < tmp.size(); i++){
                b.erase(b.begin());
            }
        }
    }
}
 
vector<int> conv(vector<int> c){
    vector<int> res;
    for(int i : c){
        for(int a : comps[i]){
            res.push_back(a);
        }
    }
    return res;
}
 
void run(int N){
    n = N;
    for(int i = 1; i <= n; i++){
        comps.push_back({i});
    }
    for(int z = 1; z < n; z++){
        random_shuffle(comps.begin(), comps.end());
        vector<int> a, b;
        for(int j = 0; j < 8; j++){
            for(int i = 0; i < comps.size(); i++){
                if((1 << j) & i) a.push_back(i);
                else b.push_back(i);
            }
            if(query(conv(a).size(), conv(b).size(), conv(a).data(), conv(b).data())) break;
            a.clear(), b.clear();
        }
        vector<int> v1 = conv(a), v2 = conv(b);
        f(v1, v2);
        f(v2, v1);
        int c1, c2;
        for(int i = 0; i < comps.size(); i++){
            for(int j : comps[i]){
                if(v1[0] == j) c1 = i;
                if(v2[0] == j) c2 = i;
            }
        }
        vector<int> v;
        v.swap(comps[c1]);
        for(int j : comps[c2]){
            v.push_back(j);
        }
        if(c1 < c2) swap(c1, c2);
        comps.erase(comps.begin() + c1);
        comps.erase(comps.begin() + c2);
        comps.push_back(v);
        setRoad(v1[0], v2[0]);
    }
}

Compilation message

icc.cpp: In function 'void f(std::vector<int>, std::vector<int>&)':
icc.cpp:17:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         for(int i = 0; i <= (b.size() - 1) / 2; i++){
      |                        ~~^~~~~~~~~~~~~~~~~~~~~
icc.cpp:24:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |             for(int i = 0; i < tmp.size(); i++){
      |                            ~~^~~~~~~~~~~~
icc.cpp: In function 'void run(int)':
icc.cpp:50:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |             for(int i = 0; i < comps.size(); i++){
      |                            ~~^~~~~~~~~~~~~~
icc.cpp:61:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         for(int i = 0; i < comps.size(); i++){
      |                        ~~^~~~~~~~~~~~~~
icc.cpp:72:9: warning: 'c2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   72 |         if(c1 < c2) swap(c1, c2);
      |         ^~
icc.cpp:68:24: warning: 'c1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |         v.swap(comps[c1]);
      |                        ^

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 600 KB Ok! 532 queries used.
2 Correct 27 ms 600 KB Ok! 655 queries used.
3 Correct 27 ms 600 KB Ok! 644 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 888 KB Ok! 1372 queries used.
2 Correct 90 ms 848 KB Ok! 1621 queries used.
3 Correct 84 ms 628 KB Ok! 1617 queries used.
4 Correct 80 ms 640 KB Ok! 1507 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 644 KB Ok! 1482 queries used.
2 Correct 78 ms 628 KB Ok! 1467 queries used.
3 Correct 84 ms 600 KB Ok! 1600 queries used.
4 Correct 76 ms 640 KB Ok! 1473 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 600 KB Ok! 1599 queries used.
2 Correct 83 ms 628 KB Ok! 1583 queries used.
3 Correct 86 ms 432 KB Ok! 1609 queries used.
4 Correct 87 ms 600 KB Ok! 1591 queries used.
5 Correct 76 ms 628 KB Ok! 1460 queries used.
6 Correct 87 ms 628 KB Ok! 1538 queries used.

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 86 ms 600 KB Ok! 1598 queries used.
2 Correct 88 ms 632 KB Ok! 1611 queries used.