답안 #348775

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348775	2021-01-15T16:35:55 Z	Alma	Poi (IOI09_poi)	C++14	70 / 100	719 ms	24044 KB

poi

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
 
void POI (vector<vector<int>>& results, int& N, int& T, int& P) {
    vector<int> value;
    value.assign(T, 0);
    // value of each problem
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < T; j++) {
            if (results[i][j] == 0) {
                value[j]++;
            }
        }
    }
    // scores: points-solved-ID
    vector<vector<int>> scores (N, vector<int> (3));
    for (int i = 0; i < N; i++) {
        int points = 0;
        int solved = 0;
        for (int j = 0; j < T; j++) {
            if (results[i][j] == 1) {
                points += value[j];
                solved++;
            }
        }
        scores[i][0] = points;
        scores[i][1] = solved;
        scores[i][2] = i+1;
    }
    // Philip:
    int P_score = scores[P-1][0];
    int P_solved = scores[P-1][1];
    int P_rank = 0;
    // Philip rank
    sort(scores.rbegin(), scores.rend());
    for (int i = 0; i < N; i++) {
        if (scores[i][0] == P_score) {
            if (scores[i][1] == P_solved) {
                if (scores[i][2] == P) {
                    P_rank = i+1;
                }}}
    }
    cout << P_score << ' ' << P_rank << endl;
}
 
int main () {
    int N, T, P; cin >> N >> T >> P;
    vector<vector<int>> results (N, vector<int> (T));
 
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < T; j++) {
            int a; cin >> a;
            results[i][j] = a;
        }
    }
    POI (results, N, T, P);
}

Subtask #1

70.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	364 KB	Output isn't correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Incorrect	1 ms	364 KB	Output isn't correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	5 ms	364 KB	Output is correct
10	Correct	6 ms	492 KB	Output is correct
11	Correct	23 ms	1004 KB	Output is correct
12	Incorrect	37 ms	1516 KB	Output isn't correct
13	Incorrect	110 ms	3820 KB	Output isn't correct
14	Correct	154 ms	5504 KB	Output is correct
15	Incorrect	270 ms	9324 KB	Output isn't correct
16	Correct	295 ms	9964 KB	Output is correct
17	Correct	434 ms	14572 KB	Output is correct
18	Correct	486 ms	16620 KB	Output is correct
19	Incorrect	652 ms	21612 KB	Output isn't correct
20	Correct	719 ms	24044 KB	Output is correct