Submission #465560

#TimeUsernameProblemLanguageResultExecution timeMemory
465560KhizriICC (CEOI16_icc)C++17
0 / 100
318 ms612 KiB
#include "icc.h" #include <bits/stdc++.h> using namespace std; //------------------------------DEFINE------------------------------ //****************************************************************** #define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0) #define ll long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) #define endl "\n" mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //****************************************************************** //----------------------------FUNCTION------------------------------ //****************************************************************** ll gcd(ll a,ll b){ if(a>b) swap(a,b); if(a==0) return a+b; return gcd(b%a,a); } ll lcm(ll a,ll b){ return a/gcd(a,b)*b; } bool is_prime(ll n){ ll k=sqrt(n); if(n==2) return true; if(n<2||n%2==0||k*k==n) return false; for(int i=3;i<=k;i+=2){ if(n%i==0){ return false; } } return true; } //***************************************************************** //--------------------------MAIN-CODE------------------------------ const int mxn=100+5; int t=1,arr[mxn][mxn]; bool qq=false; int ask(int u,int l,int r,vector<int>vt){ int x[mxn],y[mxn]; int idx=0; for(int i=l;i<=r;i++){ x[idx]=vt[i]; idx++; } y[0]=u; int ans=query(1,r-l+1,y,x); for(int i=l;i<=r;i++){ ans-=arr[u][vt[i]]; } return ans; } void solve(int a,vector<int>vt){ int l=0,r=vt.size()-1; int q=ask(a,l,r,vt); if(q==0){ return; } int ans=0; while(l<=r){ int m=(l+r)/2; q=ask(a,l,m,vt); if(q>0){ ans=m; r=m-1; } else{ l=m+1; } } arr[a][vt[ans]]=arr[vt[ans]][a]=1; qq=true; setRoad(a,vt[ans]); } void run(int n){ for(int k=1;k<=n;k++){ //bool q=true; vector<int>vt; for(int i=1;i<=n;i++){ vt.pb(i); } qq=false; for(int i=1;i<n&&!qq;i++){ vt.erase(vt.begin()); solve(i,vt); if(qq){ break; } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...