oj.uz

답안 #1050001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050001 2024-08-09T06:45:16 Z 정민찬(#11048) 카멜레온의 사랑 (JOI20_chameleon) C++17
0 / 100
 22 ms 500 KB 
#include "chameleon.h"
#include <bits/stdc++.h>

using namespace std;

int Query(const vector<int> &p);
void Answer(int a, int b);

void Solve(int N) {
    vector<vector<int>> same(2*N + 1);
    for (int i=1; i<=N; i++) {
        int p = N;
        for (int rep=0; rep<3; rep ++) {
            int lo = p+1, hi = 2*N+1;
            while (lo < hi) {
                int mid = lo + hi >> 1;
                vector<int> qry;
                for (int j=p+1; j<=mid; j++) {
                    qry.push_back(j);
                }
                int ret1 = Query(qry);
                qry.push_back(i);
                int ret2 = Query(qry);
                if (ret1 < ret2) lo = mid + 1;
                else hi = mid;
            }
            if (lo == 2*N+1) break;
            same[i].push_back(lo);
            same[lo].push_back(i);
            p = lo;
        }
    }
    vector<int> chk(2*N+1, 0);
    for (int i=1; i<=2*N; i++) {
        if (chk[i]) continue;
        if (same[i].size() == 1) {
            Answer(i, same[i][0]);
            chk[same[i][0]] = 1;
        }
        else {
            bool flag = false;
            for (auto &j : same[i]) {
                if (same[j].size() == 1) {
                    Answer(i, j);
                    chk[j] = 1;
                    flag = true;
                    break;
                }
            }
            if (flag) continue;
            int in = -1;
            for (auto &j : same[i]) {
                bool zero = false;
                for (auto &k : same[j]) {
                    if (k == i) continue;
                    vector<int> qry = {i, j, k};
                    if (Query(qry) == 1) {
                        zero = true;
                        break;
                    }
                }
                if (!zero) {
                    in = j;
                    break;
                }
            }
            for (auto &j : same[i]) {
                if (j == in) continue;
                vector<int> qry = {in, i, j};
                if (Query(qry) == 1) {
                    Answer(i, j);
                    chk[j] = 1;
                    break;
                }
            }
        }
    }
}
/*
namespace {

using std::exit;
using std::fprintf;
using std::printf;
using std::scanf;

constexpr int Q_MAX = 20000;
constexpr int N_MAX = 500;

int N;
int Y[N_MAX * 2 + 1], C[N_MAX * 2 + 1], L[N_MAX * 2 + 1];

int query_count = 0;
int answer_count = 0;
bool finishes[N_MAX * 2 + 1];

void WrongAnswer(int code) {
  printf("Wrong Answer [%d]\n", code);
  exit(0);
}

}  // namespace

int Query(const std::vector<int> &p) {
  if (++query_count > Q_MAX) WrongAnswer(3);
  bool presents[N_MAX * 2 + 1];
  for (int i = 1; i <= N * 2; ++i) presents[i] = false;
  for (const int k : p) {
    if (k <= 0 || k > N * 2) WrongAnswer(1);
    if (presents[k]) WrongAnswer(2);
    presents[k] = true;
  }
  bool colors[N_MAX + 1];
  for (int j = 1; j <= N; ++j) colors[j] = false;
  int color_count = 0;
  for (int i = 1; i <= N * 2; ++i) {
    if (!presents[i]) continue;
    const int color = presents[L[i]] ? C[L[i]] : C[i];
    if (!colors[color]) {
      ++color_count;
      colors[color] = true;
    }
  }
  return color_count;
}

void Answer(int a, int b) {
  ++answer_count;
  if (a <= 0 || a > N * 2) WrongAnswer(4);
  if (b <= 0 || b > N * 2) WrongAnswer(4);
  if (finishes[a]) WrongAnswer(5);
  finishes[a] = true;
  if (finishes[b]) WrongAnswer(5);
  finishes[b] = true;
  if (C[a] != C[b]) WrongAnswer(6);
}

int main() {
  if (scanf("%d", &N) != 1) {
    fprintf(stderr, "Error while reading input.\n");
    exit(1);
  }
  for (int i = 1; i <= N * 2; ++i) {
    if (scanf("%d", &Y[i]) != 1) {
      fprintf(stderr, "Error while reading input.\n");
      exit(1);
    }
  }
  for (int i = 1; i <= N * 2; ++i) {
    if (scanf("%d", &C[i]) != 1) {
      fprintf(stderr, "Error while reading input.\n");
      exit(1);
    }
  }
  for (int i = 1; i <= N * 2; ++i) {
    if (scanf("%d", &L[i]) != 1) {
      fprintf(stderr, "Error while reading input.\n");
      exit(1);
    }
  }
  for (int i = 1; i <= N * 2; ++i) finishes[i] = false;
  Solve(N);
  if (answer_count != N) WrongAnswer(7);
  printf("Accepted: %d\n", query_count);
  return 0;
}*/

Compilation message

chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:16:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   16 |                 int mid = lo + hi >> 1;
      |                           ~~~^~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 20 ms 488 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 20 ms 488 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -