# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740605 | ALVIN | Jakarta Skyscrapers (APIO15_skyscraper) | Pypy 3 | 76 ms | 20148 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;
int main() {
int n, m;
cin >> n >> m;
int b[m], p[m];
for (int i = 0; i < m; i++) {
cin >> b[i] >> p[i];
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (b[i] == 0) {
ans++;
continue;
}
int minJumps = INT_MAX;
for (int j = 0; j < m; j++) {
if (b[j] == 0) {
minJumps = min(minJumps, abs(b[i] - b[j]) / p[j]);
}
}
ans += minJumps;
}
cout << ans << endl;
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... |