oj.uz

답안 #575190

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
575190 2022-06-09T21:06:07 Z Uzouf 사육제 (CEOI14_carnival) C++14
100 / 100
 29 ms 320 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<<2<<' '<<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
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 208 KB Output is correct
2 Correct 15 ms 208 KB Output is correct
3 Correct 12 ms 208 KB Output is correct
4 Correct 3 ms 320 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 9 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 208 KB Output is correct
2 Correct 24 ms 208 KB Output is correct
3 Correct 11 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 7 ms 208 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 208 KB Output is correct
2 Correct 7 ms 208 KB Output is correct
3 Correct 29 ms 208 KB Output is correct
4 Correct 6 ms 320 KB Output is correct
5 Correct 5 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 16 ms 208 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 208 KB Output is correct
2 Correct 6 ms 208 KB Output is correct
3 Correct 15 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 4 ms 208 KB Output is correct
7 Correct 13 ms 208 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 208 KB Output is correct
2 Correct 12 ms 208 KB Output is correct
3 Correct 18 ms 208 KB Output is correct
4 Correct 18 ms 208 KB Output is correct
5 Correct 4 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 8 ms 208 KB Output is correct