#include <bits/stdc++.h>
#include "office.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n = GetN();
int st;
int r1 = isOnLine(1, 2, 3);
vi line1, line2;
if(r1){
line1 = {1, 2, 3};
st = 4;
}
else{
st = 5;
int r2 = isOnLine(1, 2, 4);
if(r2){
line1 = {1, 2, 4};
line2 = {3};
}
else{
int r3 = isOnLine(1, 3, 4);
if(r3){
line1 = {1, 3, 4};
line2 = {2};
}
else{
int r4 = isOnLine(2, 3, 4);
if(r4){
line1 = {2, 3,4};
line2 = {1};
}
}
}
}
if(line1.empty()){
REP(i, 4){
FOR(j, i + 1, 4, 1){
if(isOnLine(i + 1, j + 1, 5)){
line1 = {i + 1, j + 1};
REP(k, 4){
if(k != i && k != j)
line2.pb(k + 1);
}
Answer(line1[0], line1[1], line2[0], line2[1]);
exit(0);
}
}
}
}
else{
FOR(i, st, n, 2){
if(!isOnLine(i, i + 1, line1[0])){
if(!isOnLine(line1[0], line1[1], i)){
line2.pb(i);
if(line2.size() == 2) break;
if(!isOnLine(line1[0], line1[1], i + 1))
line2.pb(i + 1);
}
else
line2.pb(i + 1);
if(line2.size() == 2) break;
}
}
if(line2.size() == 1) line2.pb(n);
Answer(line1[0], line1[1], line2[0], line2[1]);
exit(0);
}
return 0;
}
Compilation message
office.c: In function 'int isOnLine(int, int, int)':
office.c:85:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
85 | _Fin(0, "Protocol error");
| ^~~~~~~~~~~~~~~~
office.c:88:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
88 | _Fin(0, "Protocol error");
| ^~~~~~~~~~~~~~~~
office.c:92:17: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
92 | _Fin(false, "Too many questions");
| ^~~~~~~~~~~~~~~~~~~~
office.c:83:7: warning: unused variable 'i' [-Wunused-variable]
83 | int i;
| ^
office.c: In function 'void Answer(int, int, int, int)':
office.c:123:13: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
123 | _Fin(0, "Protocol error");
| ^~~~~~~~~~~~~~~~
office.c:128:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
128 | if( (-_Apa[na1]==_N-3) && (na2!=na1) && (nb2!=na1) ||
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:130:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
130 | _Fin(true, "Correct");
| ^~~~~~~~~
office.c:132:22: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
132 | _Fin(false, "Wrong answer");
| ^~~~~~~~~~~~~~
office.c:134:44: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
134 | if( (-_Apa[na2]==_N-3) && (na1!=na2) && (nb1!=na2) ||
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
office.c:136:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
136 | _Fin(true, "Correct");
| ^~~~~~~~~
office.c:138:22: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
138 | _Fin(false, "Wrong answer");
| ^~~~~~~~~~~~~~
office.c:140:19: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
140 | _Fin(false, "Wrong answer");
| ^~~~~~~~~~~~~~
office.c:142:14: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
142 | _Fin(true, "Correct");
| ^~~~~~~~~
office.c:120:27: warning: unused variable 'pont' [-Wunused-variable]
120 | 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]
33 | scanf("%d", &_N);
| ~~~~~^~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct - 21 queries, 4 points |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct - 11 queries, 4 points |
| 3 |
Correct |
0 ms |
364 KB |
Output is correct - 157 queries, 4 points |
| 4 |
Correct |
0 ms |
364 KB |
Output is correct - 202 queries, 4 points |
| 5 |
Correct |
0 ms |
364 KB |
Output is correct - 252 queries, 4 points |
| 6 |
Correct |
0 ms |
364 KB |
Output is correct - 303 queries, 4 points |
| 7 |
Correct |
0 ms |
364 KB |
Output is correct - 351 queries, 4 points |
| 8 |
Correct |
0 ms |
364 KB |
Output is correct - 401 queries, 4 points |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct - 451 queries, 4 points |
| 10 |
Correct |
0 ms |
364 KB |
Output is correct - 502 queries, 4 points |
| 11 |
Correct |
0 ms |
364 KB |
Output is correct - 1002 queries, 4 points |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct - 1003 queries, 4 points |
| 13 |
Correct |
0 ms |
364 KB |
Output is correct - 1503 queries, 4 points |
| 14 |
Correct |
0 ms |
364 KB |
Output is correct - 2004 queries, 4 points |
| 15 |
Correct |
1 ms |
364 KB |
Output is correct - 2504 queries, 4 points |
| 16 |
Correct |
0 ms |
364 KB |
Output is correct - 805 queries, 4 points |
| 17 |
Correct |
0 ms |
364 KB |
Output is correct - 855 queries, 4 points |
| 18 |
Correct |
0 ms |
364 KB |
Output is correct - 901 queries, 4 points |
| 19 |
Correct |
1 ms |
492 KB |
Output is correct - 12707 queries, 4 points |
| 20 |
Correct |
1 ms |
492 KB |
Output is correct - 15001 queries, 4 points |
| 21 |
Correct |
1 ms |
492 KB |
Output is correct - 20062 queries, 4 points |
| 22 |
Correct |
1 ms |
620 KB |
Output is correct - 28063 queries, 4 points |
| 23 |
Correct |
1 ms |
620 KB |
Output is correct - 33890 queries, 4 points |
| 24 |
Correct |
1 ms |
620 KB |
Output is correct - 40945 queries, 4 points |
| 25 |
Correct |
1 ms |
748 KB |
Output is correct - 50000 queries, 4 points |
