# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969519 | 2024-04-25T09:31:13 Z | elotelo966 | Cave (IOI13_cave) | C++17 | 0 ms | 0 KB |
#pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx,avx2,fma") #include <bits/stdc++.h> using namespace std; #define int long long #define OYY 100000000000005 #define mod 998244353 #define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); #define FOR for(int i=1;i<=n;i++) #define mid (start+end)/2 #define lim 200005 #define fi first #define se second int arr[lim]; bool kesin[lim]; inline void change(int l,int kac,int val){ int cur=l,adet=0; while(kac){ if(kesin[cur]){ cur++; } else{ kac--; arr[cur]=val; } } } int32_t main(){ faster int n;cin>>n; int ans[n]; for(int i=0;i<n;i++){ int door=tryCombination(arr); if(door!=i)ans[i]=0; //cevap 0da else ans[i]=1; // cevap 1de } return 0; }