# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
932168 | 2024-02-23T04:04:29 Z | Baizho | Strange Device (APIO19_strange_device) | C++14 | 5000 ms | 524288 KB |
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> // #pragma GCC optimize("Ofast,unroll-loops,fast-math") // #pragma GCC target("popcnt") typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; #define sz size() #define ff first #define ss second #define all(a) a.begin(),a.end() #define pb push_back const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6 const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod const int N = ll(2e3)+100; const int M = ll(2e5) + 100; const long long inf = 5e18; const long double eps = 1e-15L; ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; } ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;} void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); } #define int ll void Baizho() { int n, a, b; cin>>n>>a>>b; int x = 0, y = 0, siz = 0; for(int i = 0; i <= 1e7; i ++) { x = (i + (i / b)) % a; y = i % b; // cout<<i<<" "<<x<<" "<<y<<endl; if(i > 0 && x == 0 && y == 0) break; siz ++; } set<int> st; for(int i = 0; i < siz; i ++) st.insert(i); while(n --) { int l, r; cin>>l>>r; l %= siz; r %= siz; if(l <= r) { auto it = st.lower_bound(l); vector<int> vec; while(it != st.end() && *it <= r) { // cout<<*it<<" "; vec.pb(*it); it ++; } for(auto x : vec) st.erase(x); } else { // l ... siz - 1, 0 ... r while(*st.rbegin() >= l) st.erase(--st.end()); while(*st.begin() <= r) st.erase(st.begin()); } } cout<<siz - st.size(); } signed main() { // Freopen("nondec"); ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); // precalc(); int ttt = 1; // cin>>ttt; for(int i=1; i<=ttt; i++) {Baizho(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1688 ms | 304644 KB | Output is correct |
3 | Correct | 1208 ms | 233452 KB | Output is correct |
4 | Correct | 3 ms | 1116 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 604 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 3 ms | 1116 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 1 ms | 348 KB | Output is correct |
13 | Correct | 0 ms | 600 KB | Output is correct |
14 | Correct | 1 ms | 344 KB | Output is correct |
15 | Correct | 30 ms | 6232 KB | Output is correct |
16 | Correct | 45 ms | 9548 KB | Output is correct |
17 | Correct | 452 ms | 96988 KB | Output is correct |
18 | Correct | 2728 ms | 470100 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Runtime error | 2828 ms | 524288 KB | Execution killed with signal 9 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 239 ms | 45896 KB | Output is correct |
3 | Correct | 235 ms | 46164 KB | Output is correct |
4 | Correct | 207 ms | 38536 KB | Output is correct |
5 | Correct | 478 ms | 72504 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 644 ms | 95400 KB | Output is correct |
3 | Execution timed out | 6444 ms | 524288 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 644 ms | 95400 KB | Output is correct |
3 | Execution timed out | 6444 ms | 524288 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 644 ms | 95400 KB | Output is correct |
3 | Execution timed out | 6444 ms | 524288 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Execution timed out | 6480 ms | 524288 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1688 ms | 304644 KB | Output is correct |
3 | Correct | 1208 ms | 233452 KB | Output is correct |
4 | Correct | 3 ms | 1116 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 604 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 3 ms | 1116 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |
11 | Correct | 0 ms | 348 KB | Output is correct |
12 | Correct | 1 ms | 348 KB | Output is correct |
13 | Correct | 0 ms | 600 KB | Output is correct |
14 | Correct | 1 ms | 344 KB | Output is correct |
15 | Correct | 30 ms | 6232 KB | Output is correct |
16 | Correct | 45 ms | 9548 KB | Output is correct |
17 | Correct | 452 ms | 96988 KB | Output is correct |
18 | Correct | 2728 ms | 470100 KB | Output is correct |
19 | Correct | 1 ms | 348 KB | Output is correct |
20 | Runtime error | 2828 ms | 524288 KB | Execution killed with signal 9 |
21 | Halted | 0 ms | 0 KB | - |