oj.uz

답안 #597467

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
597467 2022-07-16T04:50:15 Z 1bin CEOI16_icc (CEOI16_icc) C++14
0 / 100
 3 ms 468 KB 
#include <bits/stdc++.h>
#include "icc.h"
#include <cassert>
 
using namespace std;
 
typedef long long ll;
#define all(v) v.begin(), v.end()
const int NMAX = 105;
int par[NMAX], a[NMAX], b[NMAX], sza, szb;
int find(int x){ return par[x] == -1 ? x : par[x] = find(par[x]);}
vector<int> v[NMAX];
 
void run(int n){
    memset(par, -1, sizeof(par));
    for(int i = 1; i <= n; i++) v[i].emplace_back(i);
    int sz = n;
    
    for(int i = 0; i < n - 1; i++, sz--){
        vector<int> arr;
        for(int i = 1; i <= n; i++)
            if(par[i] == -1) arr.emplace_back(i);
            
        for(int bit = 0; (1 << bit) < sz; bit++){
            sza = szb = 0;    
            for(int j = 0; j < sz; j++){
                if(j & (1 << bit)) {
                    for(auto x : v[arr[j]]) a[sza++] = x;
                }
                else{
                    for(auto x : v[arr[j]]) b[szb++] = x;
                }
            }
            
            if(query(sza, szb, a, b)){
                int l = 0, r = sza - 1, m, x, y;
                while(l <= r){
                    m = (l + r) >> 1;
                    if(query(m + 1, szb, a, b)) r = m - 1, x = a[m];
                    else l = m + 1;
                }
                l = 0; r = szb - 1;
                while(l <= r){
                    m = (l + r) >> 1;
                    if(query(sza, m + 1, a, b)) r = m - 1, y = a[m];
                    else l = m + 1;
                }
                
                setRoad(x, y);
                x = find(x); y = find(y);
                if(v[x].size() < v[y].size()) swap(x, y);
                for(int & t : v[y]) v[x].emplace_back(t);
                par[y] = x;
                break;
            }
            assert(1 << (bit + 1) <= sz);
        }
    }
    return;
}

Compilation message

icc.cpp: In function 'void run(int)':
icc.cpp:11:30: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   11 | int find(int x){ return par[x] == -1 ? x : par[x] = find(par[x]);}
      |                         ~~~~~^
icc.cpp:36:47: note: 'y' was declared here
   36 |                 int l = 0, r = sza - 1, m, x, y;
      |                                               ^
icc.cpp:11:51: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   11 | int find(int x){ return par[x] == -1 ? x : par[x] = find(par[x]);}
      |                                            ~~~~~~~^~~~~~~~~~~~~~
icc.cpp:36:44: note: 'x' was declared here
   36 |                 int l = 0, r = sza - 1, m, x, y;
      |                                            ^

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 468 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 468 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 468 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 468 KB Wrong road!
2 Halted 0 ms 0 KB -