oj.uz

답안 #496915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496915 2021-12-22T06:31:57 Z MahfuzAhmed Ljeto (COCI21_ljeto) C++14
50 / 50
 1 ms 316 KB 
/**
 *  author: mahfuzz
 *  created: 22.12.2021
**/
 
#include <bits/stdc++.h>
using namespace std;
#define trace(x) cout << '>' << #x << ':' << x << endl;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
 

int main(int argc, char* argv[]){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    
    int n; cin >> n;
    
    vector<int> vec[10];
    
    for(int i = 0; i < n; i++){
        int t, a, b;
        cin >> t >> a >> b;
        
        vec[a].push_back(t);
    }
    
    int ansA = 0, ansB = 0;
    
    for(int i = 1; i <= 8; i++){
        for(int j = 0; j < vec[i].size(); j++){
            if(i <= 4){
                ansA += 100;
                
                if(j > 0 && abs(vec[i][j - 1] - vec[i][j]) <= 10)
                    ansA += 50;
            }else if(i > 4){
                ansB += 100;
                
                if(j > 0 && abs(vec[i][j - 1] - vec[i][j]) <= 10)
                    ansB += 50;
            }
        }
    }
    
    cout << ansA << " " << ansB << "\n";
    
    
    return 0;
}

Compilation message

Main.cpp: In function 'int main(int, char**)':
Main.cpp:31:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |         for(int j = 0; j < vec[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 312 KB Output is correct