# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45734 | mirbek01 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 116 ms | 48636 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;
const int N = 2002;
int n, m, b[N], p[N], d[N][N], dis[N];
vector < pair <int, int> > g[N];
int main(){
cin >> n >> m;
for(int i = 0; i < N; i ++){
dis[i] = 1e9;
for(int j = 0; j < N; j ++)
d[i][j] = 1e9;
}
for(int i = 1; i <= m; i ++){
cin >> b[i] >> p[i];
d[i][b[i]] = 0;
for(int j = b[i]; j + p[i] < n; j += p[i])
d[i][j + p[i]] = d[i][j] + 1;
for(int j = b[i]; j - p[i] >= 0; j -= p[i])
d[i][j - p[i]] = d[i][j] + 1;
}
for(int i = 1; i <= m; i ++){
for(int j = 1; j <= m; j ++){
if(j == i) continue;
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... |