oj.uz

답안 #575187

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
575187 2022-06-09T20:48:05 Z Uzouf 사육제 (CEOI14_carnival) C++14
0 / 100
 1 ms 208 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define ll long long
//#define endl "\n"
//int mod=1e9+7;
//const int N=2e5+5;
//template<class x>
//using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;

int n,c;
int col[155];

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(".in", "r", stdin); freopen(".out", "w", stdout);

    cin>>n;

    vector<int> ask;
    ask.push_back(1); col[1]=1; c=1;
    int lst=1;

    for (int i=2;i<=n;i++) {
      cout<<i<<' ';
      for (int j=i;j>=1;j--) {
        cout<<j<<' ';
      }
      cout<<endl;
      fflush(stdout);

      int x; cin>>x;
      if (x!=lst) {
        c++; col[i]=c;
        ask.push_back(i);
        lst=x;
      }
      else {
        for (int j:ask) {
          cout<<i<<' '<<j<<endl;
          fflush(stdout);
          int x; cin>>x;
          if (x==1) {
            col[i]=col[j];
            break;
          }
        }
      }

    }

    cout<<0<<' ';
    for(int i=1;i<=n;i++) {
      cout<<col[i]<<' ';
    }
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 0 ms 208 KB Time limit exceeded (wall clock)
2 Halted 0 ms 0 KB -