oj.uz

답안 #1049823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049823 2024-08-09T05:34:58 Z 정민찬(#11048) 카멜레온의 사랑 (JOI20_chameleon) C++17
4 / 100
 14 ms 596 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<int> rem;
    for (int i=1; i<=2*N; i++) {
        rem.push_back(i);
    }
    for (int rep=0; rep<N-1; rep++) {
        int pv = rem.back();
        rem.pop_back();
        int lo = 0, hi = rem.size() - 1;
        while (lo < hi) {
            int mid = lo + hi >> 1;
            vector<int> qry;
            for (int i=0; i<=mid; i++) {
                qry.push_back(rem[i]);
            }
            int ret1 = Query(qry);
            qry.push_back(pv);
            int ret2 = Query(qry);
            if (ret1 != ret2) {
                lo = mid + 1;
            }
            else hi = mid;
        }

        Answer(rem[lo], pv);
        rem.erase(rem.begin() + lo);
    }
    Answer(rem[0], rem[1]);
}
/*
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:19:26: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   19 |             int mid = lo + hi >> 1;
      |                       ~~~^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 13 ms 460 KB Output is correct
4 Correct 14 ms 460 KB Output is correct
5 Correct 13 ms 344 KB Output is correct
6 Correct 14 ms 344 KB Output is correct
7 Correct 14 ms 344 KB Output is correct
8 Correct 14 ms 344 KB Output is correct
9 Correct 14 ms 344 KB Output is correct

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 Incorrect 0 ms 344 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

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