oj.uz

Submission #242389

# Submission time Handle Problem Language Result Execution time Memory
242389 2020-06-27T14:27:11 Z Benq Game (IOI13_game) C++14
63 / 100
 2416 ms 256004 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
constexpr int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
template<class T> void remDup(vector<T>& v) { 
    sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

#include "game.h"

typedef struct node* pn;
struct node {
    ll d = 0; pn l,r;
    node() { l = r = NULL; }
};

typedef struct Node* pN;
struct Node {
    pn d; pN l,r;
    Node() { d = NULL, l = r = NULL; }
};

pN root = NULL;

void init(int R, int C) {
    /* ... */
}

void tri(ll& a, ll b) { a = __gcd(a,b); }

void UPD(int Q, ll K, pn& cur, int L = 0, int R = 1e9) {
    // dbg("UPD",Q,K,L,R);
    if (!cur) cur = new node();
    if (L == R) { cur->d = K; return; }
    int M = (L+R)/2;
    if (Q <= M) UPD(Q,K,cur->l,L,M);
    else UPD(Q,K,cur->r,M+1,R);
    cur->d = 0;
    if (cur->l) tri(cur->d,cur->l->d);
    if (cur->r) tri(cur->d,cur->r->d);
}

void pull(int Q, pn& cur, pn l, pn r, int L = 0, int R = 1e9) {
    if (!cur) cur = new node();
    cur->d = 0;
    if (l) tri(cur->d,l->d);
    if (r) tri(cur->d,r->d);
    if (L == R) return;
    int M = (L+R)/2;
    if (Q <= M) pull(Q,cur->l,l?l->l:NULL,r?r->l:NULL,L,M);
    else pull(Q,cur->r,l?l->r:NULL,r?r->r:NULL,M+1,R);
}

void upd(int P, int Q, ll K, pN& cur, int L = 0, int R = 1e9) {
   // dbg("upd",P,Q,K);
    if (!cur) cur = new Node();
    if (L == R) return UPD(Q,K,cur->d);
    int M = (L+R)/2;
    if (P <= M) upd(P,Q,K,cur->l,L,M);
    else upd(P,Q,K,cur->r,M+1,R);
    pull(Q,cur->d,cur->l?cur->l->d:NULL,cur->r?cur->r->d:NULL);
}

void update(int P, int Q, long long K) { 
    dbg("UPDATE");
    upd(P,Q,K,root); }

ll QUERY(int Q, int V, node* cur, int L = 0, int R = 1e9) {
    if (!cur || R < Q || V < L) return 0;
    if (Q <= L && R <= V) return cur->d;
    int M = (L+R)/2;
    return __gcd(QUERY(Q,V,cur->l,L,M),QUERY(Q,V,cur->r,M+1,R));
}

ll query(int P, int U, int Q, int V, pN cur, int L = 0, int R = 1e9) {
    if (!cur || R < P || U < L) return 0;
    if (P <= L && R <= U) return QUERY(Q,V,cur->d);
    int M = (L+R)/2;
    return __gcd(query(P,U,Q,V,cur->l,L,M),query(P,U,Q,V,cur->r,M+1,R));
}

long long calculate(int P, int Q, int U, int V) {
    dbg("QUERY");
    return query(P,U,Q,V,root);
}

Compilation message

grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~
game.cpp: In function 'void update(int, int, long long int)':
game.cpp:197:18: warning: statement has no effect [-Wunused-value]
     dbg("UPDATE");
                  ^
game.cpp: In function 'long long int calculate(int, int, int, int)':
game.cpp:215:17: warning: statement has no effect [-Wunused-value]
     dbg("QUERY");
                 ^
game.cpp: In function 'void setIn(std::__cxx11::string)':
game.cpp:130:31: 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); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
game.cpp: In function 'void setOut(std::__cxx11::string)':
game.cpp:131:32: 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); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 5 ms 384 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 892 ms 54924 KB Output is correct
5 Correct 727 ms 54424 KB Output is correct
6 Correct 875 ms 52216 KB Output is correct
7 Correct 943 ms 51960 KB Output is correct
8 Correct 645 ms 33328 KB Output is correct
9 Correct 898 ms 52292 KB Output is correct
10 Correct 886 ms 51832 KB Output is correct
11 Correct 6 ms 384 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 1454 ms 23064 KB Output is correct
13 Correct 1864 ms 13048 KB Output is correct
14 Correct 603 ms 6008 KB Output is correct
15 Correct 2140 ms 18232 KB Output is correct
16 Correct 627 ms 27768 KB Output is correct
17 Correct 1424 ms 21368 KB Output is correct
18 Correct 2225 ms 29280 KB Output is correct
19 Correct 1974 ms 29304 KB Output is correct
20 Correct 2011 ms 28804 KB Output is correct
21 Correct 5 ms 384 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 887 ms 54904 KB Output is correct
13 Correct 698 ms 54496 KB Output is correct
14 Correct 854 ms 52216 KB Output is correct
15 Correct 933 ms 51984 KB Output is correct
16 Correct 667 ms 33400 KB Output is correct
17 Correct 881 ms 52216 KB Output is correct
18 Correct 861 ms 51832 KB Output is correct
19 Correct 1404 ms 23032 KB Output is correct
20 Correct 1892 ms 12972 KB Output is correct
21 Correct 617 ms 6008 KB Output is correct
22 Correct 2130 ms 18296 KB Output is correct
23 Correct 630 ms 27896 KB Output is correct
24 Correct 1465 ms 21240 KB Output is correct
25 Correct 2416 ms 29308 KB Output is correct
26 Correct 2005 ms 29152 KB Output is correct
27 Correct 1913 ms 28776 KB Output is correct
28 Correct 990 ms 256000 KB Output is correct
29 Runtime error 1861 ms 256004 KB Execution killed with signal 9 (could be triggered by violating memory limits)
30 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 7 ms 768 KB Output is correct
3 Correct 6 ms 640 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 882 ms 54880 KB Output is correct
13 Correct 729 ms 54336 KB Output is correct
14 Correct 863 ms 52324 KB Output is correct
15 Correct 1026 ms 51936 KB Output is correct
16 Correct 696 ms 33148 KB Output is correct
17 Correct 999 ms 52252 KB Output is correct
18 Correct 953 ms 51672 KB Output is correct
19 Correct 1466 ms 22832 KB Output is correct
20 Correct 1916 ms 13152 KB Output is correct
21 Correct 634 ms 6048 KB Output is correct
22 Correct 2202 ms 18424 KB Output is correct
23 Correct 656 ms 27768 KB Output is correct
24 Correct 1419 ms 21536 KB Output is correct
25 Correct 2223 ms 29304 KB Output is correct
26 Correct 2103 ms 29212 KB Output is correct
27 Correct 1929 ms 28736 KB Output is correct
28 Correct 1031 ms 256000 KB Output is correct
29 Runtime error 1769 ms 256004 KB Execution killed with signal 9 (could be triggered by violating memory limits)
30 Halted 0 ms 0 KB -