oj.uz

Submission #587927

# Submission time Handle Problem Language Result Execution time Memory
587927 2022-07-02T14:17:12 Z MilosMilutinovic Ljeto (COCI21_ljeto) C++14
50 / 50
 1 ms 316 KB 
/**
 *    author:  wxhtzdy
 *    created: 02.07.2022 16:11:08
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n;
  cin >> n;
  vector<array<int, 3>> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i][0] >> a[i][1] >> a[i][2];
  }
  int x = 0, y = 0;
  for (int i = 0; i < n; i++) {
    if (a[i][1] <= 4) {
      x += 100;
    } else {
      y += 100;
    }
    for (int j = 0; j < i; j++) {
      if (a[j][0] >= a[i][0] - 10 && a[i][1] == a[j][1]) {
        if (a[i][1] <= 4) {
          x += 50;
        } else {
          y += 50;
        }
        break;
      }
    }
  }
  cout << x << " " << y << '\n';            
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 316 KB Output is correct
13 Correct 1 ms 212 KB Output is correct