# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164287 | ivandasfs | Highway design (CEOI12_highway) | C++14 | 5 ms | 1396 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 <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include "office.h"
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9+7;
vector <int> v;
int main() {
int n = GetN();
int x, y, z;
bool done = false;
for (x = 1 ; x<=5 ; x++) {
for (y = x+1 ; y<=5 ; y++) {
for (z = y+1 ; z<=5 ; z++) {
if (isOnLine(x, y, z)) {
done = true;
break;
}
}
if (done) break;
}
if (done) break;
}
for (int i=1 ; i<=n ; i++) {
if ((x-i)*(y-i)*(z-i) == 0) continue;
v.pb(i);
}
vector <int> sol;
for (int i=0 ; i<v.size() ; i++) {
if (i+3 >= v.size()) {
if (isOnLine(x, y, v[i]) == 0) {
sol.pb(v[i]);
}
i -= 2;
if (sol.size() >= 2) break;
} else {
if (isOnLine(v[i], v[i+1], v[i+2])) {
if (isOnLine(v[i], x, y) == 0) {
sol.pb(v[i]);
sol.pb(v[i+1]);
break;
}
} else {
for (int j=0 ; j<3 ; j++) {
if (isOnLine(x, y, v[i+j]) == 0) {
sol.pb(v[i+j]);
}
if (sol.size() >= 2) break;
}
if (sol.size() >= 2) break;
}
}
}
Answer(x, y, sol[0], sol[1]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |