oj.uz

답안 #245640

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245640 2020-07-07T02:53:59 Z tranxuanbach 사육제 (CEOI14_carnival) C++17
100 / 100
 19 ms 384 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;

// Optimization

//#pragma GCC optimize("O3")
//#define endl '\n'

// Shortcut

#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)

// I/O & Debug

#define PrintV(a) Fora(iiii, a) cout << iiii << ' '; cout << endl;
#define PrintVl(a) Fora(iiii, a) cout << iiii << endl;
#define PrintA(a, l, r) for (int iiii = l; iiii <= r; iiii++) cout << a[iiii] << ' '; cout << endl;
#define PrintAl(a, l, r) for (int iiii = l; iiii <= r; iiii++) cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(), _sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string> _itDEB(_ssDEB); DEB(_itDEB, args); }
void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
    cout << *it << " = " << a << endl;
    DEB(++it, args...);
}
*/

// Functions

//#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a))
#define mset1(a) memset(a, 1, sizeof(a))
#define msetn1(a) memset(a, -1, sizeof(a))
#define msetinf(a) memset(a, 0x3f, sizeof(a))
#define gcd __gcd
#define __builtin_popcount __builtin_popcountll
//mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
//int randt(int l, int r){ return (rando() % (r - l + 1) + l); }

// Data Structure

#define pque priority_queue
#define mts multiset
#define y0 _y0_
#define y1 _y1_
#define div divi
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <ld> vld;
typedef vector <string> vs;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <vi > vvi;
typedef vector <vll > vvll;
typedef vector <pii > vpii;
typedef vector <pll > vpll;

const int N = 150 + 5;
int mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9, inf = 1e9 + 7;
ll infll = 1e18 + 7;

int n;
int ans[N];
vi fi_col;

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n;
    ans[1] = 1;
    fi_col.pb(1);
    ForE(i, 2, n){ // 1 2 1 3 2
        int l = 1, r = fi_col.size() + 1;
        while (l < r){
            int mid = (l + r) >> 1;
            cout << mid + 1 << ' ' << i << ' ';
            For(j, 0, mid){
                cout << fi_col[j] << ' ';
            }
            cout << endl;
            int x; cin >> x;
            if (x == mid + 1){
                l = mid + 1;
            }
            else{
                r = mid;
            }
        }
        if (l == fi_col.size() + 1){
            ans[i] = fi_col.size() + 1;
            fi_col.pb(i);
        }
        else{
            ans[i] = l;
        }
    }
    cout << 0 << ' ';
    PrintA(ans, 1, n);
}

/*
==================================+
INPUT:                            |
------------------------------    |

------------------------------    |
==================================+
OUTPUT:                           |
------------------------------    |

------------------------------    |
==================================+
*/

Compilation message

carnival.cpp: In function 'int main()':
carnival.cpp:113:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (l == fi_col.size() + 1){
             ~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 17 ms 384 KB Output is correct
5 Correct 12 ms 384 KB Output is correct
6 Correct 14 ms 384 KB Output is correct
7 Correct 11 ms 384 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 11 ms 384 KB Output is correct
3 Correct 19 ms 384 KB Output is correct
4 Correct 14 ms 384 KB Output is correct
5 Correct 12 ms 384 KB Output is correct
6 Correct 16 ms 384 KB Output is correct
7 Correct 15 ms 384 KB Output is correct