oj.uz

답안 #222952

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
222952 2020-04-14T12:01:54 Z quocnguyen1012 카멜레온의 사랑 (JOI20_chameleon) C++14
0 / 100
 5 ms 384 KB 
#ifndef LOCAL
#include "chameleon.h"
#endif // LOCAL

#ifdef LOCAL
#include<bits/stdc++.h>
using namespace std;

namespace {

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

constexpr int Q_MAX = 20'000;
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) {
  //cerr << a << ' ' << b << '\n';
  ++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);
}
#endif //LOCAL
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 1005;

int n;
vector<int> ind[4];
bool found[maxn];
vector<int> adj[maxn];

void Add(vector<int> vec, int u)
{
  int lo = 0, hi = vec.size() - 1, mid;
  while(lo <= hi){
    mid = (lo + hi) / 2;
    vector<int> tmp;
    for(int i = 0; i <= mid; ++i)
      tmp.eb(vec[i]);
    tmp.eb(u);
    if(Query(tmp) != tmp.size())
      hi = mid - 1;
    else
      lo = mid + 1;
  }
  adj[u].eb(vec[lo]); adj[vec[lo]].eb(u);
  vector<int> nxt;
  for(int i = lo + 1; i < vec.size(); ++i)
    nxt.eb(vec[i]);
  nxt.eb(u);
  if(Query(nxt) != nxt.size()){
    nxt.pop_back();
    Add(nxt, u);
  }
}

void Solve(int _N)
{
  n = _N;
  for(int i = 1; i <= 2 * n; ++i){
    vector<bool> kt(4, false);
    for(int j = 0; j < 4; ++j){
      vector<int> v(ind[j]); v.eb(i);
      if(Query(v) < v.size()){
        Add(ind[j], i);
      }
      else{
        kt[j] = true;
      }
    }
    for(int j = 0; j < 4; ++j){
      if(kt[j]){
        ind[j].eb(i);
        break;
      }
    }
  }
  auto check = [&](int a, int b) -> bool
  {
    vector<int> vi;
    for(int i = 1; i <= 2 * n; ++i){
      if(i != a && i != b)
        vi.eb(i);
    }
    return vi.size() != n;
  };
  for(int i = 1; i <= 2 * n; ++i){
    if(found[i]) continue;
    for(int j : adj[i]){
      if(found[j]) continue;
      if(check(i, j)){
        found[i] = found[j] = 1;
        Answer(i, j);
        break;
      }
    }
  }
}

#ifdef LOCAL
int main() {
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  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;
}
#endif // LOCAL

Compilation message

chameleon.cpp: In function 'void Add(std::vector<int>, int)':
chameleon.cpp:96:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(Query(tmp) != tmp.size())
        ~~~~~~~~~~~^~~~~~~~~~~~~
chameleon.cpp:103:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = lo + 1; i < vec.size(); ++i)
                       ~~^~~~~~~~~~~~
chameleon.cpp:106:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(Query(nxt) != nxt.size()){
      ~~~~~~~~~~~^~~~~~~~~~~~~
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:119:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if(Query(v) < v.size()){
          ~~~~~~~~~^~~~~~~~~~
chameleon.cpp: In lambda function:
chameleon.cpp:140:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     return vi.size() != n;
            ~~~~~~~~~~^~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 384 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -