제출 #574773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
574773		m_fenais	사육제 (CEOI14_carnival)	C++14	0 / 100	121 ms	304 KiB

carnival

#include <bits/stdc++.h>
//#define endl '\n'
#define mk make_pair
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef long long ll;
using namespace std;

const int N = 1e6 + 10;
const int mod = 1e9 + 7;
map<int, int> mp;
map<int, int> ans;
int main()
{
   FAST;
   int n;
   cin>>n;
   for(int i=1; i<=n; i++)
    mp[i] = i;
   for(int i=1; i<n; i++)
   {
     for(int j=i+1; j<=n; j++)
     {
       if(i != j){
        cout<<2<<' '<<i<<' '<<j<<endl;
        int x;
        cin>>x;
        if(x == 1)
        {
          mp[j] = mp[i];
        }
      }
     }
   }
   int cnt = 1;
   for(int i=1; i<=n; i++)
   {
     for(int j=i+1; j<=n; j++)
     {
       if(mp[j] == mp[i])
        ans[j] = cnt;
     }
     if(ans[i] == 0){
      ans[i] = cnt;
      cnt++;
    }
   }
   cout<<0<<' ';
   for(int i=1; i<=n; i++)
   {
     cout<<mp[i]<<' ';
   }
   return 0;
}

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