Submission #654934

#TimeUsernameProblemLanguageResultExecution timeMemory
654934xynexAliens (IOI07_aliens)C++17
80 / 100
3 ms292 KiB
/** * Author: Tenjin * Created: 02.11.2022 11:05 * Why am I so stupid? :c * Slishkom slab **/ #include <bits/stdc++.h> // #pragma GCC optimize("inline") // #pragma GCC optimize("-fgcse,-fgcse-lm") // #pragma GCC optimize("-ftree-pre,-ftree-vrp") // #pragma GCC optimize("-ffast-math") // #pragma GCC optimize("-fipa-sra") // #pragma GCC optimize("-fpeephole2") // #pragma GCC optimize("-fsched-spec") // #pragma GCC optimize("Ofast,no-stack-protector") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") // #pragma GCC optimize("unroll-loops") using namespace std; #define ll long long #define dl double long #define ull unsigned long long #define pr pair #define vt vector #define ff first #define ss second #define mp make_pair #define sz(a) (int)a.size() #define pb push_back #define pf push_front #define popB pop_back #define popF pop_front #define bit_count __builtin_popcount #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sp(x) fixed << setprecision(x) template<typename T> T get_rand(T l, T r) { random_device rd; mt19937 gen(rd()); return uniform_int_distribution<T>(l, r)(gen); } template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); } template<class A> void read(vt<A>& v); template<class A, size_t S> void read(array<A, S>& a); template<class T> void read(T& x) { cin >> x; } void read(double& d) { string t; read(t); d = stod(t); } void read(long double& d) { string t; read(t); d = stold(t); } template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); } template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); } template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); } string to_string(char c) { return string(1, c); } string to_string(bool b) { return b ? "true" : "false"; } string to_string(const char* s) { return string(s); } string to_string(string s) { return s; } string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; } template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; } template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; } template<class A> void write(A x) { cout << to_string(x); } template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); } void print() { write("\n"); } template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); } void freop(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } const int MOD = 1e9 + 7; const int mxN = 3e6 + 5; const ll INF = 9e18; const int M = 3e3 + 5; const dl pi = acos(-1); const dl eps = 1e-12; const int sq = 700; int dx[] = {-1, 0, 1, 0}; int dy[] = {0, -1, 0, 1}; /* ll vs int*/ int N; bool bounds(int x, int y) { return (x >= 1 && x <= N && y >= 1 && y <= N); } bool ask(int x, int y) { if(!bounds(x, y)) return 0; print("examine", x, y); string s; read(s); fflush(stdout); if(s == "true") return 1; else return 0; } int left(int x, int y) { int pw = 1; while(1) { if(!ask(x, y - pw)) break; pw *= 2; } int l = max(1, y - pw), r = y; while((r - l) >= 0) { int mid = (r + l) >> 1; if(ask(x, mid)) r = mid - 1; else l = mid + 1; } return min(y, r + 1); } int right(int x, int y) { int pw = 1; while(1) { if(!ask(x, y + pw)) break; pw *= 2; } int l = y, r = min(N, y + pw); while((r - l) >= 0) { int mid = (r + l) >> 1; if(ask(x, mid)) l = mid + 1; else r = mid - 1; } return max(y, l - 1); } int left1(int x, int y) { int pw = 1; while(1) { if(!ask(x - pw, y)) break; pw *= 2; } int l = max(1, x - pw), r = x; while((r - l) >= 0) { int mid = (r + l) >> 1; if(ask(mid, y)) r = mid - 1; else l = mid + 1; } return min(x, r + 1); } int right1(int x, int y) { int pw = 1; while(1) { if(!ask(x + pw, y)) break; pw *= 2; } int l = x, r = min(N, x + pw); while((r - l) >= 0) { int mid = (r + l) >> 1; if(ask(mid, y)) l = mid + 1; else r = mid - 1; } return max(l - 1, x); } void solve() { int X, Y; read(N, X, Y); int leftY = left(X, Y), rightY = right(X, Y); int leftX = left1(X, Y), rightX = right1(X, Y); int M = rightY - leftY + 1; X = leftX + M / 2; Y = leftY + M / 2; bool cent = ask(X - M * 2, Y) & ask(X + M * 2, Y) & ask(X, Y - M * 2) & ask(X, Y + M * 2); if(cent) { print("solution", X, Y); return; } bool duet = ask(X - M, Y + M) & ask(X - M, Y - M) & ask(X + M, Y - M) & ask(X + M, Y + M); if(duet) { int ansX = 0, ansY = 0; if(ask(X, Y + M * 2)) ansY = Y + M; else ansY = Y - M; if(ask(X + M * 2, Y)) ansX = X + M; else ansX = X - M; print("solution", ansX, ansY); return; } if(!ask(X - M * 2, Y)) X += M * 2; else if(!ask(X + M * 2, Y)) X -= M * 2; if(!ask(X, Y - M * 2)) Y += M * 2; else if(!ask(X, Y + M * 2)) Y -= M * 2; print("solution", X, Y); } int main() { //freop(""); int t = 1; //read(t); for (int i = 1; i <= t; ++i) { //write("Case #" + to_string(i) + ": "); solve(); } return 0; }

Compilation message (stderr)

aliens.cpp: In function 'void solve()':
aliens.cpp:163:28: warning: unused variable 'rightX' [-Wunused-variable]
  163 |   int leftX = left1(X, Y), rightX = right1(X, Y);
      |                            ^~~~~~
aliens.cpp: In function 'void freop(std::string)':
aliens.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
aliens.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...