oj.uz

Submission #41436

# Submission time Handle Problem Language Result Execution time Memory
41436 2018-02-17T08:36:09 Z Nurlykhan Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 1004 KB 
#include <bits/stdc++.h>

#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
#define vec vector<int>
#define dead not_bad

#define left not_right
#define y1 what

using namespace std;

const int N = (int) 3e4 + 10;
const int M = (int) 2e4 + 10;
const ll LINF = (ll) 1e18;
const int INF = (int) 1e9 + 7;
const double PI = 3.14159265359;
const double EPS = (double) 1e-9;

int nx[8] = {-1, -2, -2, -1, 1, 1, 2, 2};
int ny[8] = {-2, -1, 1, 2, -2, 2, -1, 1};

int n, m;
int b[N], p[N];
ll d[N];
bool u[N];

int main() {
  #define fn "teams"
  #ifdef witch
      freopen("input.txt", "r", stdin);
      freopen("output.txt", "w", stdout);
  #else
      //freopen(fn".in", "r", stdin);
      //freopen(fn".out", "w", stdout);
  #endif
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> b[i] >> p[i];
    d[i] = LINF;
  }
  d[0] = 0;
  for (int iter = 1; iter < m; iter++) {
    int id = -1;
    for (int i = 0; i < m; i++) {
      if (!u[i] && (id == -1 || d[id] > d[i])) {
        id = i;
      }
    }
    if (id == -1 || d[id] == LINF) 
      break;
    u[id] = 1;
    for (int i = 0; i < m; i++) {
      if ((b[i] - b[id]) % p[id] == 0) {
        int e = abs(b[i] - b[id]) / p[id];
        if (d[id] + e < d[i]) {
          d[i] = d[id] + e;
        }
      }
    }
  }
  if (d[1] == LINF)
    d[1] = -1;
  cout << d[1];
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 2 ms 532 KB Output is correct
7 Correct 1 ms 548 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 548 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 620 KB Output is correct
9 Correct 2 ms 620 KB Output is correct
10 Correct 3 ms 624 KB Output is correct
11 Correct 33 ms 656 KB Output is correct
12 Correct 48 ms 748 KB Output is correct
13 Correct 52 ms 748 KB Output is correct
14 Correct 31 ms 748 KB Output is correct
15 Correct 31 ms 748 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 2 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 2 ms 748 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 1 ms 748 KB Output is correct
7 Correct 2 ms 748 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 2 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 32 ms 748 KB Output is correct
12 Correct 64 ms 748 KB Output is correct
13 Correct 47 ms 748 KB Output is correct
14 Correct 31 ms 768 KB Output is correct
15 Correct 31 ms 768 KB Output is correct
16 Correct 2 ms 768 KB Output is correct
17 Correct 24 ms 768 KB Output is correct
18 Correct 2 ms 768 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 48 ms 768 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 26 ms 768 KB Output is correct
25 Correct 28 ms 768 KB Output is correct
26 Correct 45 ms 768 KB Output is correct
27 Correct 48 ms 768 KB Output is correct
28 Correct 30 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 2 ms 768 KB Output is correct
31 Correct 4 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 39 ms 768 KB Output is correct
34 Correct 31 ms 768 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 768 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 33 ms 768 KB Output is correct
12 Correct 47 ms 768 KB Output is correct
13 Correct 49 ms 768 KB Output is correct
14 Correct 30 ms 768 KB Output is correct
15 Correct 31 ms 768 KB Output is correct
16 Correct 2 ms 768 KB Output is correct
17 Correct 24 ms 768 KB Output is correct
18 Correct 2 ms 768 KB Output is correct
19 Correct 2 ms 768 KB Output is correct
20 Correct 48 ms 768 KB Output is correct
21 Correct 2 ms 768 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 8 ms 768 KB Output is correct
24 Correct 27 ms 768 KB Output is correct
25 Correct 28 ms 768 KB Output is correct
26 Correct 45 ms 768 KB Output is correct
27 Correct 47 ms 768 KB Output is correct
28 Correct 30 ms 768 KB Output is correct
29 Correct 6 ms 768 KB Output is correct
30 Correct 2 ms 768 KB Output is correct
31 Correct 4 ms 768 KB Output is correct
32 Correct 3 ms 768 KB Output is correct
33 Correct 31 ms 768 KB Output is correct
34 Correct 31 ms 768 KB Output is correct
35 Execution timed out 1058 ms 1004 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 2 ms 1004 KB Output is correct
3 Correct 2 ms 1004 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 2 ms 1004 KB Output is correct
8 Correct 2 ms 1004 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 4 ms 1004 KB Output is correct
11 Correct 32 ms 1004 KB Output is correct
12 Correct 47 ms 1004 KB Output is correct
13 Correct 50 ms 1004 KB Output is correct
14 Correct 31 ms 1004 KB Output is correct
15 Correct 31 ms 1004 KB Output is correct
16 Correct 2 ms 1004 KB Output is correct
17 Correct 24 ms 1004 KB Output is correct
18 Correct 2 ms 1004 KB Output is correct
19 Correct 2 ms 1004 KB Output is correct
20 Correct 48 ms 1004 KB Output is correct
21 Correct 2 ms 1004 KB Output is correct
22 Correct 2 ms 1004 KB Output is correct
23 Correct 9 ms 1004 KB Output is correct
24 Correct 25 ms 1004 KB Output is correct
25 Correct 28 ms 1004 KB Output is correct
26 Correct 47 ms 1004 KB Output is correct
27 Correct 47 ms 1004 KB Output is correct
28 Correct 30 ms 1004 KB Output is correct
29 Correct 6 ms 1004 KB Output is correct
30 Correct 2 ms 1004 KB Output is correct
31 Correct 4 ms 1004 KB Output is correct
32 Correct 3 ms 1004 KB Output is correct
33 Correct 31 ms 1004 KB Output is correct
34 Correct 31 ms 1004 KB Output is correct
35 Execution timed out 1069 ms 1004 KB Time limit exceeded
36 Halted 0 ms 0 KB -