제출 #1289266

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289266		__ugur__	카멜레온의 사랑 (JOI20_chameleon)	C++20	40 / 100	26 ms	2996 KiB

chameleon

#include "chameleon.h"
#include <vector>
#include <bitset>
#include <iostream>
#include <algorithm>
#include <map>


using namespace std;


void Solve(int N) {
  
  //cout << Query({1, 3, 4, 7}) << '\n';
  //cout << Query({1, 2, 3, 4, 5, 6, 7, 8}) << '\n';
  //cout << Query({3, 4, 5, 6, 7, 8}) << '\n';
  //cout << Query({2, 3, 4, 5, 6, 8}) << '\n';
  //cout << Query({2, 3, 4, 5, 6, 7}) << '\n';
  //cout << Query({2, 3, 4, 5, 7, 8}) << '\n';
  //cout << Query({2, 3, 4, 5, 7}) << '\n';

  bitset<1001> found;
  vector<int> counts(2*N+1, 3);
  map<vector<int>, int> pre_calc;
  for(int i=1; i<=2*N; i++) {
    vector<int> tests;
    if(found[i])
      continue;
    for(int j=2*N; j>0; j--) {
      if(found[j] || i == j)
        continue;
      if(pre_calc[{i, j}] == 0)
        pre_calc[{i, j}] = Query({i, j});
      if(pre_calc[{i, j}] == 1) {
        tests.push_back(j);
        counts[j]--;
      }
      if(tests.size() == counts[i])
        break;
    }

    vector<int> check_same[counts[i]];
    for(int j=1; j<=2*N; j++) {
      if(i == j)
        continue;
      for(int k=0; k<counts[i]; k++) {
        if(tests[k] != j)
          check_same[k].push_back(j); 
      }
    }
    vector<int> results;
    for(int k=0; k<counts[i]; k++) {

      if(pre_calc[check_same[k]] == 0)
        pre_calc[check_same[k]] = Query(check_same[k]);
      results.push_back(pre_calc[check_same[k]]);
    }
    int same = min_element(results.begin(), results.end()) - results.begin();
    same = tests[same];
    found[i] = 1;
    found[same] = 1;
    counts[same] = 0;
    counts[i] = 0;
    Answer(i, same);
  }
  
}

• Subtask 1: 0 / 4
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36