#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
highway.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("O3")
highway.cpp:6:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization ("unroll-loops")
highway.cpp: In function 'void setIO(std::__cxx11::string)':
highway.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen((s+".in").c_str(),"r",stdin);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
highway.cpp:29:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen((s+".out").c_str(),"w",stdout);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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 |
0 ms |
256 KB |
Output is correct - 21 queries, 4 points |
| 2 |
Correct |
0 ms |
256 KB |
Output is correct - 11 queries, 4 points |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct - 157 queries, 4 points |
| 4 |
Correct |
0 ms |
256 KB |
Output is correct - 202 queries, 4 points |
| 5 |
Correct |
0 ms |
256 KB |
Output is correct - 252 queries, 4 points |
| 6 |
Correct |
0 ms |
256 KB |
Output is correct - 303 queries, 4 points |
| 7 |
Correct |
0 ms |
256 KB |
Output is correct - 351 queries, 4 points |
| 8 |
Correct |
0 ms |
256 KB |
Output is correct - 401 queries, 4 points |
| 9 |
Correct |
0 ms |
256 KB |
Output is correct - 451 queries, 4 points |
| 10 |
Correct |
0 ms |
256 KB |
Output is correct - 502 queries, 4 points |
| 11 |
Correct |
0 ms |
256 KB |
Output is correct - 1002 queries, 4 points |
| 12 |
Correct |
0 ms |
384 KB |
Output is correct - 1003 queries, 4 points |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct - 1503 queries, 4 points |
| 14 |
Correct |
0 ms |
384 KB |
Output is correct - 2004 queries, 4 points |
| 15 |
Correct |
0 ms |
384 KB |
Output is correct - 2504 queries, 4 points |
| 16 |
Correct |
0 ms |
384 KB |
Output is correct - 805 queries, 4 points |
| 17 |
Correct |
0 ms |
256 KB |
Output is correct - 855 queries, 4 points |
| 18 |
Correct |
0 ms |
256 KB |
Output is correct - 901 queries, 4 points |
| 19 |
Correct |
1 ms |
384 KB |
Output is correct - 12707 queries, 4 points |
| 20 |
Correct |
1 ms |
384 KB |
Output is correct - 15001 queries, 4 points |
| 21 |
Correct |
1 ms |
512 KB |
Output is correct - 20062 queries, 4 points |
| 22 |
Correct |
1 ms |
512 KB |
Output is correct - 28063 queries, 4 points |
| 23 |
Correct |
1 ms |
640 KB |
Output is correct - 33890 queries, 4 points |
| 24 |
Correct |
1 ms |
640 KB |
Output is correct - 40945 queries, 4 points |
| 25 |
Correct |
1 ms |
768 KB |
Output is correct - 50000 queries, 4 points |
