| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 103661 |
2019-04-01T21:15:35 Z |
Benq |
Worm Worries (BOI18_worm) |
C++14 |
|
802 ms |
6332 KB |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 100001;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
re(first); re(rest...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...); // print w/ spaces
}
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
template<class T> T invGeneral(T a, T b) {
a %= b; if (a == 0) return b == 1 ? 0 : -1;
T x = invGeneral(b,a);
return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}
template<class T> struct modInt {
T val;
T mod = 0;
// static const T mod = MOD;
void normalize() {
if (mod == 0) return;
val %= mod; if (val < 0) val += mod;
}
modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
// modInt(T v = 0, T m = 0) : val(v) { normalize(); }
explicit operator T() const { return val; }
friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }
friend void check(modInt& a, modInt& b) { // make sure all operations are valid
// comment out if mod is static const
if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
if (a.mod != mod) { a.mod = mod; a.normalize(); }
if (b.mod != mod) { b.mod = mod; b.normalize(); }
}
friend modInt operator+(modInt a, modInt b) {
check(a,b); a.val += (T)b;
if (a.val >= a.mod) a.val -= a.mod;
return a;
}
friend modInt operator-(modInt a, modInt b) {
check(a,b); a.val -= (T)b;
if (a.val < 0) a.val += a.mod;
return a;
}
friend modInt operator-(const modInt& a) { return modInt(0)-a; }
friend modInt operator*(modInt a, modInt b) {
check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
}
friend modInt exp(modInt a, ll p) {
modInt ans(1,a.mod);
for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend modInt inv(const modInt& a) {
return {invGeneral(a.val,a.mod),a.mod};
// return exp(b,b.mod-2) if prime
}
friend modInt operator/(modInt a, modInt b) {
check(a,b); return a*inv(b);
}
};
typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
int N,M,K,Q;
map<array<int,3>,int> m;
int query(int x, int y = 1, int z = 1) {
if (x < 1 || x > N) return 0;
if (y < 1 || y > M) return 0;
if (z < 1 || z > K) return 0;
if (m.count({x,y,z})) return m[{x,y,z}];
cout << "? " << x << " " << y << " " << z << endl;
// return 1000-abs(x-150)-abs(y-100)-abs(z-100);
int r; re(r);
// r = 1000-abs(x-457)-abs(y-100)-abs(z-100);
return m[{x,y,z}] = r;
}
void fin(int x, int y = 1, int z = 1) {
cout << "! " << x << " " << y << " " << z << endl;
exit(0);
}
ld phi = (1+sqrt(5))/2;
/*void stage2(int l, int m, int r) {
}
void stage1(int r) {
int l = 1;
if (r-l == 1) fin(1);
if (r-l == 2) {
if (query(2) > query(1)) fin(2);
else fin(1);
}
int m = (r-l)/phi/phi+l;
if (query(l) >= query(m)) return stage1(m);
stage2();
}*/
void stage(int l, int m, int r) {
if (r-l == 0) exit(5);
if (r-l == 1) {
if (query(l) >= query(l+1)) fin(l);
else fin(l+1);
}
if (r-l == 2) {
if (query(l+1) >= query(l) && query(l+1) >= query(r)) fin(l+1);
if (query(l) >= query(l+1) && query(l) >= query(r)) fin(l);
fin(l+2);
}
if (r-l <= 2 || (l == m || m == r)) {
ps("WHAT",l,m,r);
exit(0);
}
// 0 -> 0
// 1 -> 1 b
// 2 -> 2 bu
// 3 -> 3 bug
// 0 -> 1 (b)
// 1 -> 2 (u)
// 2 -> 3 (g)
int m0, m1, len = min(m-l,r-m), actual = (r-l)/phi/phi;
if (m-l < r-m) {
m0 = m; m1 = r-actual;
} else {
m1 = m; m0 = l+actual;
}
if (m0 == m1) m1 ++;
if (query(m0) > query(m1)) stage(l,m0,m1);
else stage(m0,m1,r);
}
void tRight(int r) {
if (r == 3) {
if (query(2) > query(1)) fin(2);
fin(1);
}
if (r == 2) fin(1);
int len = (r-1)/phi/phi;
if (query(1+len) > query(1)) stage(1,1+len,r);
else tRight(1+len);
}
void tLeft(int l) {
if (l == N-2) {
if (query(N-1) > query(N)) fin(N-1);
fin(N);
}
if (l == N-1) fin(N);
int len = (N-l)/phi/phi;
if (query(N-len) > query(N)) stage(l,N-len,N);
else tLeft(N-len);
}
void solve1() {
if (query(1) <= query(N)) return tLeft(1);
return tRight(N);
}
void solve2(pi x, pi y, pi bes) {
// ps("??",x,y,bes);
if (x.f == x.s && y.f == y.s) fin(bes.f,bes.s);
if (x.s-x.f > y.s-y.f) {
int m = (x.f+x.s)/2;
FOR(i,y.f,y.s+1) if (query(m,i) > query(bes.f,bes.s)) bes = {m,i};
if (bes.f != m) {
if (bes.f < m) solve2({x.f,m-1},y,bes);
else solve2({m+1,x.s},y,bes);
} else {
if (query(bes.f,bes.s) < query(bes.f-1,bes.s)) {
solve2({x.f,m-1},y,{bes.f-1,bes.s});
} else if (query(bes.f,bes.s) < query(bes.f+1,bes.s)) {
solve2({m+1,x.s},y,{bes.f+1,bes.s});
} else fin(bes.f,bes.s);
}
} else {
int m = (y.f+y.s)/2;
FOR(i,x.f,x.s+1) if (query(i,m) > query(bes.f,bes.s)) bes = {i,m};
if (bes.s != m) {
if (bes.s < m) solve2(x,{y.f,m-1},bes);
else solve2(x,{m+1,y.s},bes);
} else {
if (query(bes.f,bes.s) < query(bes.f,bes.s-1)) {
solve2(x,{y.f,m-1},{bes.f,bes.s-1});
} else if (query(bes.f,bes.s) < query(bes.f,bes.s+1)) {
solve2(x,{m+1,y.s},{bes.f,bes.s+1});
} else fin(bes.f,bes.s);
}
}
}
int xd[6] = {1,-1,0,0,0,0}, yd[6] = {0,0,1,-1,0,0}, zd[6] = {0,0,0,0,1,-1};
void solve3() {
array<int,4> bes = array<int,4>();
F0R(i,Q/2) {
int x = rand() % N+1, y = rand() % M+1, z = rand() % K+1;
ckmax(bes,{query(x,y,z),x,y,z});
}
bool bad = 1;
while (bad) {
bad = 0;
F0R(i,6) if (query(bes[1]+xd[i],bes[2]+yd[i],bes[3]+zd[i]) > bes[0]) {
bes = {query(bes[1]+xd[i],bes[2]+yd[i],bes[3]+zd[i]),
bes[1]+xd[i],
bes[2]+yd[i],
bes[3]+zd[i]};
bad = 1;
break;
}
}
fin(bes[1],bes[2],bes[3]);
}
int main() {
re(N,M,K,Q);
if (M == 1 && K == 1) solve1();
else if (K == 1) solve2({1,N},{1,M},{1,1});
else solve3();
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/
Compilation message
worm.cpp: In function 'void stage(int, int, int)':
worm.cpp:254:17: warning: unused variable 'len' [-Wunused-variable]
int m0, m1, len = min(m-l,r-m), actual = (r-l)/phi/phi;
^~~
worm.cpp: In function 'void io::setIn(std::__cxx11::string)':
worm.cpp:117:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~
worm.cpp: In function 'void io::setOut(std::__cxx11::string)':
worm.cpp:118:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
256 KB |
Output is correct |
| 3 |
Correct |
2 ms |
256 KB |
Output is correct |
| 4 |
Correct |
2 ms |
384 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 ms |
256 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
256 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
408 KB |
Output is correct |
| 9 |
Correct |
3 ms |
412 KB |
Output is correct |
| 10 |
Correct |
2 ms |
256 KB |
Output is correct |
| 11 |
Correct |
3 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
384 KB |
Output is correct |
| 2 |
Correct |
7 ms |
384 KB |
Output is correct |
| 3 |
Correct |
7 ms |
256 KB |
Output is correct |
| 4 |
Correct |
7 ms |
256 KB |
Output is correct |
| 5 |
Correct |
9 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
4 ms |
324 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
428 KB |
Output is correct |
| 2 |
Correct |
23 ms |
424 KB |
Output is correct |
| 3 |
Correct |
24 ms |
376 KB |
Output is correct |
| 4 |
Correct |
17 ms |
448 KB |
Output is correct |
| 5 |
Correct |
17 ms |
460 KB |
Output is correct |
| 6 |
Correct |
34 ms |
504 KB |
Output is correct |
| 7 |
Correct |
31 ms |
376 KB |
Output is correct |
| 8 |
Correct |
24 ms |
560 KB |
Output is correct |
| 9 |
Correct |
27 ms |
424 KB |
Output is correct |
| 10 |
Correct |
25 ms |
444 KB |
Output is correct |
| 11 |
Correct |
25 ms |
376 KB |
Output is correct |
| 12 |
Correct |
14 ms |
468 KB |
Output is correct |
| 13 |
Correct |
25 ms |
500 KB |
Output is correct |
| 14 |
Correct |
30 ms |
504 KB |
Output is correct |
| 15 |
Correct |
27 ms |
424 KB |
Output is correct |
| 16 |
Correct |
25 ms |
508 KB |
Output is correct |
| 17 |
Correct |
24 ms |
504 KB |
Output is correct |
| 18 |
Correct |
27 ms |
424 KB |
Output is correct |
| 19 |
Correct |
22 ms |
384 KB |
Output is correct |
| 20 |
Correct |
22 ms |
424 KB |
Output is correct |
| 21 |
Correct |
18 ms |
504 KB |
Output is correct |
| 22 |
Correct |
16 ms |
528 KB |
Output is correct |
| 23 |
Correct |
27 ms |
424 KB |
Output is correct |
| 24 |
Correct |
33 ms |
504 KB |
Output is correct |
| 25 |
Correct |
27 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
456 ms |
3312 KB |
Output is correct |
| 2 |
Correct |
469 ms |
3516 KB |
Output is correct |
| 3 |
Correct |
291 ms |
3260 KB |
Output is correct |
| 4 |
Correct |
448 ms |
3440 KB |
Output is correct |
| 5 |
Correct |
469 ms |
3488 KB |
Output is correct |
| 6 |
Correct |
447 ms |
3332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
474 ms |
5116 KB |
Output is correct |
| 2 |
Correct |
699 ms |
5056 KB |
Output is correct |
| 3 |
Correct |
687 ms |
5020 KB |
Output is correct |
| 4 |
Correct |
758 ms |
5416 KB |
Output is correct |
| 5 |
Correct |
730 ms |
5140 KB |
Output is correct |
| 6 |
Correct |
620 ms |
5288 KB |
Output is correct |
| 7 |
Correct |
480 ms |
5108 KB |
Output is correct |
| 8 |
Correct |
610 ms |
5436 KB |
Output is correct |
| 9 |
Correct |
673 ms |
5188 KB |
Output is correct |
| 10 |
Correct |
802 ms |
6332 KB |
Output is correct |
| 11 |
Correct |
552 ms |
5308 KB |
Output is correct |
