oj.uz

Submission #1089885

# Submission time Handle Problem Language Result Execution time Memory
1089885 2024-09-17T11:10:56 Z toast12 Ljeto (COCI21_ljeto) C++14
50 / 50
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<vector<int>> v(1+8);
    for (int i = 0; i < n; i++) {
        int t, a, b;
        cin >> t >> a >> b;
        v[a].push_back(t);
    }
    int a = 0, b = 0;
    for (int i = 1; i <= 4; i++) {
        a += v[i].size() * 100;
        for (int j = 1; j < v[i].size(); j++) {
            if (v[i][j]-v[i][j-1] <= 10)
                a += 50;
        }
    }
    for (int i = 5; i <= 8; i++) {
        b += v[i].size() * 100;
        for (int j = 1; j < v[i].size(); j++) {
            if (v[i][j]-v[i][j-1] <= 10)
                b += 50;
        }
    }
    cout << a << ' ' << b << '\n';
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:16:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         for (int j = 1; j < v[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~
Main.cpp:23:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for (int j = 1; j < v[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
25.0 / 25.0

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