| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 163227 |
2019-11-11T23:09:15 Z |
galen_colin |
Game (IOI13_game) |
C++14 |
|
3 ms |
376 KB |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
#define f0r(a, b) for (long long a = 0; a < b; a++)
#define f1r(a, b, c) for (long long a = b; a < c; a++)
#define f0rd(a, b) for (long long a = b; a >= 0; a--)
#define f1rd(a, b, c) for (long long a = b; a >= c; a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < n; i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
// template<typename A, typename B> ll max(A x, B y) {
// return x > y ? x : y;
// }
// template<typename A, typename B> ll min(A x, B y) {
// return x < y ? x : y;
// }
mt19937 rng(steady_clock::now().time_since_epoch().count());
/* usage - just do rng() */
void usaco(string filename) {
#pragma message("be careful, freopen may be wrong")
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const ll mod = 998244353;
ll madd(ll a, ll b) {
return (a + b) % mod;
}
ll msub(ll a, ll b) {
return (((a - b) % mod) + mod) % mod;
}
ll mmul(ll a, ll b) {
return ((a % mod) * (b % mod)) % mod;
}
ll mpow(ll base, ll exp) {
ll res = 1;
while (exp) {
if (exp % 2 == 1){
res = (res * base) % mod;
}
exp >>= 1;
base = (base * base) % mod;
}
return res;
}
ll minv(ll base) {
return mpow(base, mod - 2);
}
ll mdiv(ll a, ll b) {
return mmul(a, minv(b));
}
ll gcd(ll x, ll y) {
if (x == 0) return y;
if (y == 0) return x;
return gcd(y, x % y);
}
bool prime[1000006];
void sieve(int n) {
f0r(i, n + 1) prime[i] = 1;
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
prime[1] = prime[0] = 0;
}
ll n, m, k, q, Q, T, l, r, x, y, z;
ll a[500005];
ll b[500005];
string s, t;
ll ans = 0;
using implicit_segtree = struct implicit_segtree;
struct implicit_segtree {
ll v, sz;
implicit_segtree* child[2];
implicit_segtree() {
v = 0;
child[0] = nullptr;
child[1] = nullptr;
sz = 0;
}
implicit_segtree(int n) {
v = 0;
child[0] = nullptr;
child[1] = nullptr;
sz = n;
}
implicit_segtree* ch(int x) {
if (!child[x]) child[x] = new implicit_segtree(sz);
return child[x];
}
void add(int loc, ll val) {
add(loc, val, 0, sz - 1);
}
ll add(int loc, ll val, int l, int r) {
if (l > loc || r < loc) return v;
if (l == r) return v = val;
ll m = (l + r) / 2;
ll a = ch(0)->add(loc, val, l, m);
ll b = ch(1)->add(loc, val, m + 1, r);
// cout << "inner " << l << " " << r << " " << a << " " << b << " " << gcd(a, b) << endl;
return v = gcd(a, b);
}
ll query(int ql, int qr) {
return query(ql, qr, 0, sz - 1);
}
ll query(int ql, int qr, int tl, int tr) {
if (qr < tl || ql > tr || tl > tr) return 0;
// cout << tl << " " << tr << " " << v << endl;
if (ql <= tl && tr <= qr) return v;
ll a = 0, b = 0, m = (tl + tr) / 2;
if (child[0]) a = ch(0)->query(ql, qr, tl, m);
if (child[1]) b = ch(1)->query(ql, qr, m + 1, tr);
// cout << tl << " " << tr << " " << a << " " << b << endl;
return gcd(a, b);
}
};
using implicit_segtree_lv2 = struct implicit_segtree_lv2;
struct implicit_segtree_lv2 {
int sz;
implicit_segtree v;
implicit_segtree_lv2* child[2];
implicit_segtree_lv2() {
v = implicit_segtree(m);
child[0] = nullptr;
child[1] = nullptr;
sz = 0;
}
implicit_segtree_lv2(int n) {
v = implicit_segtree(m);
child[0] = nullptr;
child[1] = nullptr;
sz = n;
}
implicit_segtree_lv2* ch(int x) {
if (!child[x]) child[x] = new implicit_segtree_lv2(sz);
return child[x];
}
void add(int loc, int loc2, ll val) {
return add(loc, loc2, val, 0, sz - 1);
}
void add(int loc, int loc2, ll val, int l, int r) {
// cout << "outer " << l << " " << r << " " << loc2 << " " << val << endl;
v.add(loc2, val);
if (l == r) return;
ll m = (l + r) / 2;
if (loc <= m) ch(0)->add(loc, loc2, val, l, m);
else ch(1)->add(loc, loc2, val, m + 1, r);
}
ll query(int ql1, int qr1, int ql2, int qr2) {
return query(ql1, qr1, ql2, qr2, 0, n - 1);
}
ll query(int ql1, int qr1, int ql2, int qr2, int tl, int tr) {
if (qr1 < tl || ql1 > tr || tl > tr) return 0;
if (ql1 <= tl && tr <= qr1) return v.query(ql2, qr2);
// cout << ql1 << " " << qr1 << " " << ql2 << " " << qr2 << endl;
ll a = 0, b = 0, m = (tl + tr) / 2;
if (child[0]) a = ch(0)->query(ql1, qr1, ql2, qr2, tl, m);
if (child[1]) b = ch(1)->query(ql1, qr1, ql2, qr2, m + 1, tr);
return gcd(a, b);
}
};
#include "game.h"
implicit_segtree_lv2 st;
void init(int r, int c) {
n = r;
m = c;
st = implicit_segtree_lv2(n);
}
void update(int r, int c, ll v) {
st.add(r, c, v);
}
ll calculate(int r1, int c1, int r2, int c2) {
ll v = st.query(r1, r2, c1, c2);
return (v == 0 ? 1 : v);
}
// int main() {
// io;
// // freopen("case", "r", stdin);
// // freopen("test.txt", "r", stdin);
// // freopen("case", "w", stdout);
// // freopen("file.in", "r", stdin);
// // usaco("file");
// // exploreCave(4);
// cin >> n >> m >> Q;
// init(n, m);
// f0r(i, Q) {
// cin >> q;
// if (q == 1) {
// ll a, b, c; cin >> a >> b >> c;
// update(a, b, c);
// } else {
// ll a, b, c, d; cin >> a >> b >> c >> d;
// cout << "Q " << a << " " << b << " " << c << " " << d << endl;
// cout << calculate(a, b, c, d) << endl;
// }
// }
// }
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 usaco(std::__cxx11::string)':
game.cpp:54:53: note: #pragma message: be careful, freopen may be wrong
#pragma message("be careful, freopen may be wrong")
^
game.cpp:55:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen((filename + ".in").c_str(), "r", stdin);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
game.cpp:56:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen((filename + ".out").c_str(), "w", stdout);
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
