oj.uz

Submission #972749

# Submission time Handle Problem Language Result Execution time Memory
972749 2024-05-01T05:28:23 Z yeediot Carnival (CEOI14_carnival) C++17
100 / 100
 6 ms 704 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=155;
vector<int>cur;
int n;
int v[mxn];
#ifdef local
void init(){
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
}
int query(int mm,int j){
    vector<int>ck(n+1);
    int res=0;
    for(int i=0;i<=mm;i++){
        int x=cur[i];
        res+=(ck[x]==0);
        ck[x]=1;
    }
    res+=(ck[v[j]]==0);
    return res;
}
#else
void init(){}
int query(int mm,int j){
    cout<<mm+2<<' ';
    for(int i=0;i<=mm;i++){
        cout<<cur[i]<<' ';
    }
    cout<<j;
    cout<<endl;
    int x;
    cin>>x;
    return x;
}
#endif
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n;
    init();
    vector<int>ans(n+1);
    int cnt=0;
    for(int i=1;i<=n;i++){
        int l=0,r=sz(cur);
        while(l<r){
            int mm=l+r>>1;
            int x=query(mm,i);
            if(x==mm+2){
                l=mm+1;
            }
            else{
                r=mm;
            }
        }
        if(l==sz(cur)){
            ans[i]=++cnt;
            cur.pb(i);
        }
        else{
            ans[i]=ans[cur[l]];
        }
        debug(cur);
    }
    cout<<0<<' ';
    for(int i=1;i<=n;i++){
        cout<<ans[i]<<' ';
    }
    cout<<'\n';
}
 /*
 input:
 
 */

Compilation message

carnival.cpp: In function 'int main()':
carnival.cpp:100:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  100 |             int mm=l+r>>1;
      |                    ~^~
carnival.cpp: In function 'void setIO(std::string)':
carnival.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
carnival.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 452 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 5 ms 704 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 456 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 5 ms 456 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 4 ms 460 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 2 ms 344 KB Output is correct
6 Correct 3 ms 452 KB Output is correct
7 Correct 5 ms 460 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 5 ms 452 KB Output is correct
4 Correct 6 ms 452 KB Output is correct
5 Correct 3 ms 452 KB Output is correct
6 Correct 3 ms 456 KB Output is correct
7 Correct 3 ms 460 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 540 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 4 ms 460 KB Output is correct
5 Correct 4 ms 452 KB Output is correct
6 Correct 4 ms 456 KB Output is correct
7 Correct 5 ms 456 KB Output is correct