oj.uz

Submission #578898

# Submission time Handle Problem Language Result Execution time Memory
578898 2022-06-18T07:28:20 Z Trisanu_Das Ljeto (COCI21_ljeto) C++17
0 / 50
 1 ms 428 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
  int n; cin >> n;
  vector<array<int, 3> > a(n);
  for(int i = 0; i < n; i++) cin >> a[n][0] >> a[n][1] >> a[n][2];
  vector<int> moves(8, INT_MIN);
  sort(a.begin(), a.end());
  int pa = 0, pb = 0;
  for(int i = 0; i < n; i++){
    if(a[i][1] <= 4){
      pa += 100;
      if(moves[a[i][1]] + 10 >= a[i][0]) pa += 50;
      moves[a[i][1]] = a[i][0];
    }else{
      pb += 100;
      if(moves[a[i][1]] + 10 >= a[i][0]) pb += 50;
      moves[a[i][1]] = a[i][0];
    }
  }
  cout << pa << ' ' << pb << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 428 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -