# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117345 | JohnTitor | Highway design (CEOI12_highway) | C++11 | 6 ms | 1404 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define mask(i) ((1LL<<(i)))
#define builtin_popcount __builtin_popcountll
#define __builtin_popcount __builtin_popcountll
using ll=long long; using ld=long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); const ld pi=acos(0)*2;
template <typename T> inline void read(T &x){char c; bool nega=0; while((!isdigit(c=getchar()))&&(c!='-')); if(c=='-'){nega=1; c=getchar();} x=c-48; while(isdigit(c=getchar())) x=x*10+c-48; if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10); putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){ putchar('-'); x=-x;} writep(x);}
template <typename T> inline void writeln(T x){write(x); putchar('\n');}
#define taskname "Highway"
#ifdef Aria
void Answer(int a, int b, int c, int d){}
bool isOnLine(int a, int b, int c){}
int GetN(){};
#else
#include "office.h"
#endif // Aria
int n;
int a=1;
int x, y, z, t;
void answer(int a, int b, int c, int d){
// assert(a);
// assert(b);
// assert(c);
// assert(d);
// assert(a!=b);
// assert(a!=c);
// assert(a!=d);
// assert(b!=c);
// assert(b!=d);
// assert(c!=d);
Answer(a, b, c, d);
exit(0);
}
bool isonline(int a, int b, int c){
// assert(a);
// assert(b);
// assert(c);
// assert(a!=b);
// assert(a!=c);
// assert(b!=c);
return isOnLine(a, b, c);
}
vector <int> all;
int main(){
n=GetN();
FOR(i, 1, n) all.pb(i);
shuffle(all.begin(), all.end(), rng);
a=all.back();
all.pop_back();
// bool bad=1;
while(true){
int b=all.back();
all.pop_back();
int c=all.back();
all.pop_back();
if(isonline(a, b, c)){
t=b;
continue;
}
else{
// assert(all.size());
int d=all.back();
all.pop_back();
if(isonline(a, b, d)){
x=a;
y=b;
z=c;
}
else if(isonline(a, c, d)){
x=a;
y=c;
z=b;
}
else{
x=b;
y=c;
z=a;
if(t) answer(x, y, z, t);
all.pb(d);
}
// bad=0;
break;
}
}
// if(bad) assert(0);
while(true){
int p=all.back();
// all.pop_back();
// int q=all.back();
// all.pop_back();
// if(isonline(x, p, q)) continue;
if(!isonline(x, y, p)){
t=p;
break;
}
}
answer(x, y, z, t);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |