oj.uz

답안 #212772

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212772 2020-03-24T09:30:49 Z WLZ 카멜레온의 사랑 (JOI20_chameleon) C++14
24 / 100
 57 ms 504 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
 
namespace {
  vector< vector<int> > g;
  vector<int> found, st;

  int check(vector<int> v, int cur) {
    v.push_back(cur);
    return (Query(v) < (int) v.size());
  }

  void find(vector<int>& v, int cur) {
    while (check(v, cur)) {
      int lo = 0, hi = (int) v.size() - 1;
      while (lo < hi) {
        int mid = (lo + hi) / 2;
        if (check(vector<int>(v.begin(), v.begin() + mid + 1), cur)) {
          hi = mid;
        } else {
          lo = mid + 1;
        }
      }
      found.push_back(v[lo]);
      v = vector<int>(v.begin() + lo + 1, v.end());
    }
  }
}
 
void Solve(int N) {
  g.resize(2 * N + 1);
  st.resize(2 * N + 1);
  st[1] = 0;
  for (int i = 2; i <= 2 * N; i++) {
    found.clear();
    vector<int> a, b;
    for (int j = 1; j < i; j++) {
      if (st[j] == 0) {
        a.push_back(j);
      } else {
        b.push_back(j);
      }
    }
    find(a, i);
    find(b, i);
    if (found.empty()) {
      st[i] = 0;
    } else {
      for (auto& x : found) {
        st[i] = !st[x];
        g[i].push_back(x);
        g[x].push_back(i);
      }
    }
  }
  vector<int> used(2 * N + 1, 0), in(2 * N + 1, -1), out(2 * N + 1, -1);
  for (int i = 1; i <= 2 * N; i++) {
    if ((int) g[i].size() == 1) {
      continue;
    }
    if (Query({i, g[i][0], g[i][1]}) == 1) {
      out[i] = g[i][2];
      in[g[i][2]] = i;
    } else if (Query({i, g[i][0], g[i][2]}) == 1) {
      out[i] = g[i][1];
      in[g[i][1]] = i;
    } else {
      out[i] = g[i][0];
      in[g[i][0]] = i;
    }
  }
  for (int i = 1; i <= 2 * N; i++) {
    if (used[i]) {
      continue;
    }
    for (auto& x : g[i]) {
      if (x != in[i] && x != out[i]) {
        Answer(i, x);
        used[i] = used[x] = 1;
      }
    }
  }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 33 ms 384 KB Output is correct
4 Correct 33 ms 416 KB Output is correct
5 Correct 33 ms 384 KB Output is correct
6 Correct 33 ms 384 KB Output is correct
7 Correct 33 ms 384 KB Output is correct
8 Correct 33 ms 384 KB Output is correct
9 Correct 34 ms 384 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 308 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Incorrect 4 ms 384 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 308 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Incorrect 4 ms 384 KB Wrong Answer [6]
5 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 53 ms 384 KB Output is correct
4 Correct 52 ms 384 KB Output is correct
5 Correct 54 ms 384 KB Output is correct
6 Correct 52 ms 384 KB Output is correct
7 Correct 53 ms 384 KB Output is correct
8 Correct 57 ms 504 KB Output is correct
9 Correct 53 ms 384 KB Output is correct

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 33 ms 384 KB Output is correct
4 Correct 33 ms 416 KB Output is correct
5 Correct 33 ms 384 KB Output is correct
6 Correct 33 ms 384 KB Output is correct
7 Correct 33 ms 384 KB Output is correct
8 Correct 33 ms 384 KB Output is correct
9 Correct 34 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 308 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Incorrect 4 ms 384 KB Wrong Answer [6]
14 Halted 0 ms 0 KB -