oj.uz

Submission #740607

# Submission time Handle Problem Language Result Execution time Memory
740607 2023-05-12T19:06:12 Z ALVIN Jakarta Skyscrapers (APIO15_skyscraper) C++17
0 / 100
 1 ms 212 KB 
#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]);
      }
    }
    if (minJumps == INT_MAX) {
      cout << -1 << endl;
      return 0;
    }
    ans += minJumps;
  }

  cout << ans << endl;

  return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -