# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
675411 | Dan4Life | 이상한 기계 (APIO19_strange_device) | C++17 | 3173 ms | 464448 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define int long long
const int maxn = (int)1e6+10;
int n, A, B;
pair<int,int> a[maxn];
unordered_map<int,unordered_map<int,bool>> vis;
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> A >> B;
for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se; int i;
for(i = 0; i < 10000000; i++){
int x = (i+i/B)%A, y = i%B;
//cout << x << " " << y << "\n";
if(vis[x][y]) break; vis[x][y]=1;
}
for(int j = 0; j < n; j++) cout << min(a[j].se-a[j].fi+1, i) << "\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |