Submission #518593

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
518593	2022-01-24T08:56:10 Z	blue	Poi (IOI09_poi)	C++17	100 / 100	557 ms	23824 KB

poi

#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int N, T, P;
    cin >> N >> T >> P;
    
    vector<int> S(T+1, 0);
    
    vector<int> TC(N+1, 0);
    
    int** solved = new int*[N+1];
    for(int i = 1; i <= N; i++) solved[i] = new int[T+1];
    for(int i = 1; i <= N; i++) for(int j = 1; j <= T; j++)
    {
        cin >> solved[i][j];
        S[j] += solved[i][j];
        TC[i] += solved[i][j];
    }
    
    vector<int> score(N+1, 0);
    for(int i = 1; i <= N; i++) for(int j = 1; j <= T; j++) score[i] += solved[i][j] * (N - S[j]);
    int r = 1;
    for(int i = 1; i < P; i++) if(score[i] > score[P] || (score[i] == score[P] && TC[i] >= TC[P])) r++;
    for(int i = P+1; i <= N; i++) if((score[i] > score[P]) || (score[i] == score[P] && TC[i] > TC[P])) r++;
    
    cout << score[P] << ' ' << r << '\n';
    
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	292 KB	Output is correct
3	Correct	1 ms	292 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	304 KB	Output is correct
8	Correct	2 ms	336 KB	Output is correct
9	Correct	3 ms	336 KB	Output is correct
10	Correct	4 ms	476 KB	Output is correct
11	Correct	17 ms	1012 KB	Output is correct
12	Correct	28 ms	1452 KB	Output is correct
13	Correct	83 ms	3780 KB	Output is correct
14	Correct	122 ms	5308 KB	Output is correct
15	Correct	204 ms	9032 KB	Output is correct
16	Correct	221 ms	9868 KB	Output is correct
17	Correct	330 ms	14328 KB	Output is correct
18	Correct	376 ms	16256 KB	Output is correct
19	Correct	492 ms	21352 KB	Output is correct
20	Correct	557 ms	23824 KB	Output is correct