# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
78632 | ekrem | Highway design (CEOI12_highway) | C++98 | 4 ms | 1592 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>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1000005
using namespace std;
#include "office.h"
int n, x, y, z, bas;
vector < int > ans;
// extern int GetN();
// extern int isOnLine(int x, int y, int z);
// extern void Answer(int a1, int b1, int a2, int b2);
int bul(){
for(int i = bas; i <= n - 1; i += 2){
if(ans.size() >= 2)
return 0;
if(!isOnLine(z, i, i + 1)){
if(isOnLine(y, z, i))
ans.pb(i + 1);
else{
ans.pb(i);
if(!isOnLine(y, z, i + 1))
ans.pb(i + 1);
}
}
}
}
int main() {
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
n = GetN();
x = 1; y = 2; z = 3;
bas = 4;
bul();
Answer(x, y, ans[0], ans[1]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |