Submission #740607

#	Time	Username	Problem	Language	Result	Execution time	Memory
740607		ALVIN	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	1 ms	212 KiB

skyscraper

#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
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43