# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253755 | Nucleist | Highway design (CEOI12_highway) | C++14 | 1 ms | 768 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 "office.h"
#include <bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define EPS 0.000001
struct greateri
{
template<class T>
bool operator()(T const &a, T const &b) const { return a > b; }
};
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str(),"w",stdout);
}
int main(){
int n=GetN();
int k=isOnLine(1,2,3);
if(k){
bool ka=0;
int ans1=1,ans2=2,ans3=0,ans4=n;
for (int i = 4; i <= n-1; i+=2)
{
int yo=isOnLine(ans1,i,i+1);
if(yo){;}
if(!ka && !yo){
int fo=isOnLine(ans1,ans2,i);
ans3=i;
if(fo)ans3++;
else{
int zo=isOnLine(ans1,ans2,i+1);
if(!zo){
ans4=i+1;
break;
}
}
ka=1;
}
else if(!yo && ka){
int fo=isOnLine(ans1,ans2,i);
ans4=i;
if(fo)ans4++;
break;
}
}
Answer(ans1,ans2,ans3,ans4);
return 0;
}
int j=isOnLine(1,2,4);
int f=isOnLine(1,3,4);
int z=isOnLine(2,3,4);
if(!k && !j && !f && !z){
k=isOnLine(5,1,2);
j=isOnLine(5,1,3);
f=isOnLine(5,1,4);
int k1=isOnLine(5,2,3);
int j1=isOnLine(5,2,4);
int f1=isOnLine(5,3,4);
if(k){
Answer(1,2,3,4);
}
else if(j){
Answer(1,3,2,4);
}
else if(f){
Answer(1,4,2,3);
}
else if(k1){
Answer(2,3,1,4);
}
else if(j1){
Answer(2,4,1,3);
}
else if(f1){
Answer(3,4,1,2);
}
}
else{
int ans1=0,ans2=0,ans3=0,ans4=n;
if(k){
ans1=2,ans2=3,ans3=4;
}
else if(j){
ans1=2,ans2=4,ans3=3;
}
else if(f){
ans1=3,ans2=4,ans3=2;
}
else{
ans1=3,ans2=4,ans3=1;
}
for (int i = 5; i <= n-1; i+=2)
{
int yo=isOnLine(ans1,i,i+1);
if(yo){;}
else{
int fo=isOnLine(ans1,ans2,i);
ans4=i;
if(fo)ans4++;
break;
}
}
Answer(ans1,ans2,ans3,ans4);
}
return 0;
}
//code the AC sol !
// BS/queue/map
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |