oj.uz

답안 #995898

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995898 2024-06-10T03:33:01 Z kustizus 사육제 (CEOI14_carnival) C++17
100 / 100
 14 ms 856 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=150;
int n,ans[N+5],mp[N+5][N+5];
int Ask(int l, int r){
    if (mp[l][r]) return mp[l][r];
    cout<<r-l+1<<' ';
    for (int i=l;i<=r;++i) cout<<i<<' ';
    cout<<"\n";
    fflush(stdout);
    int ans;
    cin>>ans;
    return mp[l][r]=ans;
}
void Solve(){
    cin>>n;
    for (int i=1;i<=n;++i)
        for (int j=1;j<=n;++j)
            mp[i][j]=0;
    for (int i=1;i<=n;++i) ans[i]=i;
    for (int i=2;i<=n;++i){
        if (Ask(1,i)!=Ask(1,i-1)) continue;
        int l=1,r=i-1;
        while (l<r){
            int md=l+r>>1;
            if (Ask(md+1,i)==Ask(md+1,i-1)) l=md+1;
            else r=md;
        }
        ans[i]=ans[l];
    }
    cout<<0<<' ';
    map <int,bool> mp;
    map <int,int> cnt;
    for (int i=1;i<=n;++i) mp[ans[i]]=true;
    int idx=0;
    for (pair <int,int> x : mp)
        cnt[x.first]=++idx;
    for (int i=1;i<=n;++i) cout<<cnt[ans[i]]<<' ';
    cout<<"\n";
    fflush(stdout);
}
signed main(){
    int t=1;
    // cin>>t;
    while (t--) Solve();
}

Compilation message

carnival.cpp: In function 'void Solve()':
carnival.cpp:26:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |             int md=l+r>>1;
      |                    ~^~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 600 KB Output is correct
2 Correct 10 ms 612 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 7 ms 600 KB Output is correct
6 Correct 7 ms 852 KB Output is correct
7 Correct 8 ms 600 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 600 KB Output is correct
2 Correct 14 ms 616 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 8 ms 600 KB Output is correct
6 Correct 7 ms 600 KB Output is correct
7 Correct 8 ms 600 KB Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 600 KB Output is correct
2 Correct 9 ms 600 KB Output is correct
3 Correct 4 ms 620 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 5 ms 600 KB Output is correct
7 Correct 8 ms 600 KB Output is correct

Subtask #5
20.0 / 20.0

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