제출 #531553

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531553		devariaota	사육제 (CEOI14_carnival)	C++17	0 / 100	2 ms	200 KiB

carnival

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

int a[151], n;
map<pair<int,int>, int> mp;

int ask(int x, int y){
  if(x > y) swap(x, y);
  if(mp.count({x, y}))
  {
    return mp[{x, y}];
  }
  cout << "2 " << x << " " << y << endl;
  int z;
  cin >> z;
  return mp[{x, y}] = z;
}

int main(){
  cin.tie(0) -> ios_base::sync_with_stdio(0);

  cin >> n;
  iota(a, a + n, 1);
  for(int i=0;i<n;i++)
  {
    for(int j=0;j<i;j++)
    {
      if(ask(a[i], a[j]) == 1)
      {
        a[i] = a[j];
      }
    }
  }
  cout << "0 " << flush;
  for(int i=0;i<n;i++) cout << a[i] << " "; 
  cout << endl;
  return 0;
}

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