oj.uz

답안 #35758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
35758 2017-11-29T10:46:41 Z funcsr CEOI16_icc (CEOI16_icc) C++14
100 / 100
 143 ms 2092 KB 
#include "icc.h"
#include <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
#include <set>
#include <cassert>
#define rep(i, n) for (int i=0; i<(n); i++)
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;

int query(vector<int> a, vector<int> b) {
  if (a.empty() || b.empty()) return 0;
  int ar[100] = {}, br[100] = {};
  rep(i, a.size()) ar[i] = a[i]+1;
  rep(i, b.size()) br[i] = b[i]+1;
  return query(a.size(), b.size(), ar, br);
}
int N;
int U[100], id[100];
vector<int> R[100];
int find(int x) {
  if (U[x] == x) return x;
  return U[x] = find(U[x]);
}
void unite(int x, int y) {
  x = find(x), y = find(y);
  if (x == y) return;
  if (R[x].size() < R[y].size()) swap(x, y);
  U[y] = x;
  for (int t : R[y]) R[x].pb(t);
  R[y].clear();
}
vector<int> roots() {
  vector<int> ret;
  rep(i, N) if (find(i) == i) {
    id[i] = ret.size();
    ret.pb(i);
  }
  return ret;
}
int find(vector<int> X, vector<int> other) {
  if (X.size() == 1) return X[0];
  vector<int> a, b;
  rep(i, X.size()) {
    if (i&1) b.pb(X[i]);
    else     a.pb(X[i]);
  }
  if (query(a, other)) return find(a, other);
  else                 return find(b, other);
}

void run(int n) {
  N = n;
  rep(i, N) U[i] = i, R[i].pb(i);

  rep(_, N-1) {
    vector<int> a, b;
    vector<int> vs = roots();
    int n = vs.size();
    int XOR = 0;
    pair<vector<int>, vector<int>> ps;
    for (int e=0; (1<<e)<n; e++) {
      vector<int> Sa, Sb;
      rep(i, n) {
        if ((i>>e)&1) for (int x : R[vs[i]]) Sa.pb(x);
        else          for (int x : R[vs[i]]) Sb.pb(x);
      }
      if (query(Sa, Sb)) {
        XOR ^= 1<<e;
        swap(a, Sa);
        swap(b, Sb);
      }
    }
    if (a.size() > b.size()) swap(a, b);
    int u = find(a, b);
    int v = find(R[vs[id[find(u)]^XOR]], {u});
    //assert((id[find(u)]^id[find(v)]) == XOR);
    unite(u, v);
    setRoad(u+1, v+1);
  }
}

Compilation message

icc.cpp: In function 'int query(std::vector<int>, std::vector<int>)':
icc.cpp:8:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
icc.cpp:17:3: note: in expansion of macro 'rep'
   rep(i, a.size()) ar[i] = a[i]+1;
   ^
icc.cpp:8:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
icc.cpp:18:3: note: in expansion of macro 'rep'
   rep(i, b.size()) br[i] = b[i]+1;
   ^
icc.cpp: In function 'int find(std::vector<int>, std::vector<int>)':
icc.cpp:8:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i, n) for (int i=0; i<(n); i++)
                                  ^
icc.cpp:47:3: note: in expansion of macro 'rep'
   rep(i, X.size()) {
   ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2092 KB Ok! 109 queries used.
2 Correct 6 ms 2092 KB Ok! 105 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 2088 KB Ok! 597 queries used.
2 Correct 33 ms 2092 KB Ok! 485 queries used.
3 Correct 36 ms 2088 KB Ok! 526 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 2092 KB Ok! 1539 queries used.
2 Correct 109 ms 2088 KB Ok! 1196 queries used.
3 Correct 139 ms 2088 KB Ok! 1513 queries used.
4 Correct 129 ms 2088 KB Ok! 1489 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 2092 KB Ok! 1461 queries used.
2 Correct 139 ms 2088 KB Ok! 1445 queries used.
3 Correct 126 ms 2088 KB Ok! 1417 queries used.
4 Correct 136 ms 2088 KB Ok! 1527 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 2092 KB Ok! 1304 queries used.
2 Correct 136 ms 2088 KB Ok! 1393 queries used.
3 Correct 123 ms 2092 KB Ok! 1356 queries used.
4 Correct 133 ms 2092 KB Ok! 1339 queries used.
5 Correct 126 ms 2088 KB Ok! 1479 queries used.
6 Correct 123 ms 2088 KB Ok! 1367 queries used.

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 119 ms 2092 KB Ok! 1417 queries used.
2 Correct 119 ms 2088 KB Ok! 1393 queries used.