Submission #583142

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
583142	2022-06-24T22:09:53 Z	evening_g	Poi (IOI09_poi)	C++11	5 / 100	254 ms	16072 KB

poi

/**
 * @file poi.cpp
 * @brief https://oj.uz/problem/view/IOI09_poi
 * @version 0.1
 * @date 2022-06-24
 * 
 * 
 */

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int find_rank(const vector<int> &v, const int &target) {
    int index = 0;
    while(v[index] != target) index++;
    return index + 1;
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    // DEFINE VARIABLES

    int n, t, p;

    cin >> n >> t >> p;

    vector< vector<int> > contestants(n, vector<int>(t)); // tasks solved by each contestant
    vector<int> tasks(t, 0);    // worth of each task
    vector<int> score(n, 0);    // score of each contestant

    // READ DATA

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < t; j++) {
            cin >> contestants[i][j];
            // if this user solved this task
            if (contestants[i][j] == 1) {
                // the worth of the task decreases with each contestant that solves it
                tasks[j] ++;
            }
        }        
    }
    
    // PROCESS
    //calculate score of each contestant
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < t; j++) {
            if (contestants[i][j] == 1) {
                // the worth of the task decreases with each contestant that solves it
                score[i] += tasks[j];
            } 
        }
    }
    
    // get philip schore
    int philip_score = score[p - 1];

    // sort by score
    sort(score.begin(), score.end(), greater<int>());

    // as there can't be contestats with the same score
    // we use philip's score to find its rank

    cout << philip_score << " " << find_rank(score, philip_score) << '\n';
       
    return 0;
}

Subtask #1

5.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	212 KB	Output isn't correct
2	Incorrect	1 ms	212 KB	Output isn't correct
3	Correct	1 ms	212 KB	Output is correct
4	Incorrect	0 ms	212 KB	Output isn't correct
5	Incorrect	1 ms	212 KB	Output isn't correct
6	Incorrect	1 ms	212 KB	Output isn't correct
7	Incorrect	1 ms	340 KB	Output isn't correct
8	Incorrect	2 ms	340 KB	Output isn't correct
9	Incorrect	1 ms	340 KB	Output isn't correct
10	Incorrect	3 ms	340 KB	Output isn't correct
11	Incorrect	11 ms	724 KB	Output isn't correct
12	Incorrect	13 ms	1124 KB	Output isn't correct
13	Incorrect	34 ms	2644 KB	Output isn't correct
14	Incorrect	53 ms	3668 KB	Output isn't correct
15	Incorrect	85 ms	6228 KB	Output isn't correct
16	Incorrect	95 ms	6712 KB	Output isn't correct
17	Incorrect	138 ms	9776 KB	Output isn't correct
18	Incorrect	214 ms	10964 KB	Output isn't correct
19	Incorrect	206 ms	14420 KB	Output isn't correct
20	Incorrect	254 ms	16072 KB	Output isn't correct