제출 #465552

#제출 시각아이디문제언어결과실행 시간메모리
465552KhizriICC (CEOI16_icc)C++17
7 / 100
472 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]; void run(int n){ for(int k=1;k<n;k++){ bool q=true; for(int i=1;i<=n&&q;i++){ for(int j=i+1;j<=n;j++){ if(arr[i][j]) continue; int x[100],y[100]; x[0]=i,y[0]=j; if(query(1,1,x,y)==1){ arr[i][j]=1; setRoad(i,j); q=false; 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...