#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include "office.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
int n = GetN();
int a = -1, b = -1, rm = -1;
map<array<int, 3>, int> res;
repn(i, 1, 4) repn(j, i + 1, 4) repn(k, j + 1, 4){
array<int, 3> ar = {i, j, k};
sort(all(ar));
if(isOnLine(i, j, k)){
res[ar] = 1;
a = i, b = j, rm = k;
break;
}
else res[ar] = 2;
}
int c = -1, d = -1;
vi pos;
repn(i, 1, n + 1) if(i != a && i != b && i != rm) pos.pb(i);
vector<pi> pr;
for(int i = 0; i < pos.size() - (int)(pos.size() & 1); i += 2) pr.pb({pos[i], pos[i + 1]});
if(pos.size() & 1) pr.pb({1e9, pos[pos.size() - 1]});
int ind = 0;
while(true){
pi cur = pr[ind];
int st = cur.fi, st1 = cur.se;
if(st == 1e9){
d = st1;
break;
}
if(ind == (pr.size() - 1) && pos.size() % 2 == 0 && (c == -1 && d == -1)){
c = st;
d = st1;
break;
}
if(st1 <= n && st <= n){
array<int, 3> ar1 = {a, st, st1};
sort(all(ar1));
if(d == -1 && ind == (int)(pr.size() - 1) && pos.size() % 2 == 0){
array<int, 3> ar2 = {a, st1, b};
sort(all(ar2));
if(res[ar2] != 1 && (res[ar2] == 2 || !isOnLine(a, b, st1))){
if(c == -1) c = st1;
else if(d == -1) d = st1;
}
else{
if(c == -1) c = st;
else if(d == -1) d = st;
}
}
else if(res[ar1] != 1 && (res[ar1] == 2 || !isOnLine(a, st, st1))){
array<int, 3> ar2 = {a, st, b};
sort(all(ar2));
if(res[ar2] != 1 && (res[ar2] == 2 || !isOnLine(a, b, st))){
if(c == -1) c = st;
else if(d == -1) d = st;
}
if(c != -1 && d != -1) break;
ar2 = {a, st1, b};
sort(all(ar2));
if(res[ar2] != 1 && (res[ar2] == 2 || !isOnLine(a, b, st1))){
if(c == -1) c = st1;
else if(d == -1) d = st1;
}
}
}
else if(st1 > n && st <= n){
array<int, 3> ar2 = {a, st, b};
sort(all(ar2));
if(res[ar2] != 1 && (res[ar2] == 2 || !isOnLine(a, b, st))){
if(c == -1) c = st;
else if(d == -1) d = st;
}
}
else if(st1 <= n && st > n){
array<int, 3> ar2 = {a, st1, b};
sort(all(ar2));
if(res[ar2] != 1 && (res[ar2] == 2 || !isOnLine(a, b, st1))){
if(c == -1) c = st1;
else if(d == -1) d = st1;
}
}
if(st > n && st1 > n) break;
if(c != -1 && d != -1) break;
ind++;
}
Answer(a, b, c, d);
return 0;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
Compilation message
highway.cpp: In function 'int main()':
highway.cpp:47:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < pos.size() - (int)(pos.size() & 1); i += 2) pr.pb({pos[i], pos[i + 1]});
~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
highway.cpp:57:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(ind == (pr.size() - 1) && pos.size() % 2 == 0 && (c == -1 && d == -1)){
~~~~^~~~~~~~~~~~~~~~~~
office.c: In function 'int isOnLine(int, int, int)':
office.c:85:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(0, "Protocol error");
^
office.c:88:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(0, "Protocol error");
^
office.c:92:37: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(false, "Too many questions");
^
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
int i;
^
office.c: In function 'void Answer(int, int, int, int)':
office.c:123:29: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(0, "Protocol error");
^
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:130:30: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(true, "Correct");
^
office.c:132:36: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(false, "Wrong answer");
^
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:136:30: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(true, "Correct");
^
office.c:138:36: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(false, "Wrong answer");
^
office.c:140:33: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(false, "Wrong answer");
^
office.c:142:23: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
_Fin(true, "Correct");
^
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
int na1, nb1, na2, nb2, pont;
^~~~
office.c: In function 'void _doInit()':
office.c:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &_N);
~~~~~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
Output is correct - 21 queries, 4 points |
| 2 |
Correct |
4 ms |
384 KB |
Output is correct - 11 queries, 4 points |
| 3 |
Correct |
4 ms |
384 KB |
Output is correct - 157 queries, 4 points |
| 4 |
Correct |
4 ms |
384 KB |
Output is correct - 202 queries, 4 points |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct - 252 queries, 4 points |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct - 303 queries, 4 points |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct - 351 queries, 4 points |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct - 401 queries, 4 points |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct - 451 queries, 4 points |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct - 502 queries, 4 points |
| 11 |
Correct |
5 ms |
512 KB |
Output is correct - 1002 queries, 4 points |
| 12 |
Correct |
5 ms |
384 KB |
Output is correct - 1003 queries, 4 points |
| 13 |
Correct |
5 ms |
512 KB |
Output is correct - 1503 queries, 4 points |
| 14 |
Correct |
5 ms |
512 KB |
Output is correct - 2004 queries, 4 points |
| 15 |
Correct |
5 ms |
640 KB |
Output is correct - 2504 queries, 4 points |
| 16 |
Correct |
5 ms |
384 KB |
Output is correct - 805 queries, 4 points |
| 17 |
Correct |
5 ms |
512 KB |
Output is correct - 855 queries, 4 points |
| 18 |
Correct |
5 ms |
384 KB |
Output is correct - 901 queries, 4 points |
| 19 |
Correct |
9 ms |
1408 KB |
Output is correct - 12707 queries, 4 points |
| 20 |
Correct |
10 ms |
1664 KB |
Output is correct - 15001 queries, 4 points |
| 21 |
Correct |
12 ms |
2044 KB |
Output is correct - 20062 queries, 4 points |
| 22 |
Correct |
15 ms |
2812 KB |
Output is correct - 28063 queries, 4 points |
| 23 |
Correct |
18 ms |
3324 KB |
Output is correct - 33890 queries, 4 points |
| 24 |
Correct |
21 ms |
3964 KB |
Output is correct - 40945 queries, 4 points |
| 25 |
Correct |
25 ms |
4728 KB |
Output is correct - 50000 queries, 4 points |
