# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
466059 |
2021-08-17T16:03:39 Z |
Khizri |
ICC (CEOI16_icc) |
C++17 |
|
273 ms |
504 KB |
#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);
return ans;
}
void solve(int a,vector<int>v){
vector<int>vt;
for(int i=0;i<v.size();i++){
if(!arr[a][v[i]]){
vt.pb(v[i]);
}
}
int l=0,r=vt.size()-1,ans=-1;
int q=ask(a,l,r,vt);
if(q==0){
return;
}
for(int i=0;i<r;i++){
int q=ask(a,i+1,r,vt);
if(q==0){
ans=i;
arr[a][vt[ans]]=arr[vt[ans]][a]=1;
qq=true;
setRoad(a,vt[ans]);
return;
}
}
if(ans==-1){
ans=r;
}
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;
}
}
}
}
Compilation message
icc.cpp: In function 'void solve(int, std::vector<int>)':
icc.cpp:60:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
60 | for(int i=0;i<v.size();i++){
| ~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
460 KB |
Ok! 196 queries used. |
2 |
Incorrect |
7 ms |
460 KB |
Wrong road! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
22 ms |
496 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
93 ms |
504 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
34 ms |
460 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
34 ms |
460 KB |
Wrong road! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
273 ms |
496 KB |
Number of queries more than 3250 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |