Submission #479273

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
479273	2021-10-11T05:49:03 Z	Spartan117	Poi (IOI09_poi)	C++14	100 / 100	921 ms	24388 KB

poi

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

struct contestant
{
    vector<int> responses;
    int id;
    int numOfQuestions;
    int score;
    contestant(const int &i)
    {
        id = i;
        numOfQuestions = 0;
        score = 0;
    }
};

vector<contestant> contestants;
map<int, int> marksperTask;
int n{}, t{}, p{};

void inputContestants()
{
    cin >> n >> t >>p;
    int response{};
    for(int i{}; i<n; i++)
    {
        contestants.push_back(contestant(i+1));
        for(int j{}; j<t; j++)
        {
            cin >> response;
            contestants[i].responses.push_back(response);
            if(response==0)
                marksperTask[j+1]++;
        }
        int qnums{};
        for(int response: contestants[i].responses)
            qnums+=response;
        contestants[i].numOfQuestions = qnums;
    }
    
    for(int i{}; i<n; i++)
    {
        for(int j{}; j<t; j++)
            if (contestants[i].responses[j]==1)
                contestants[i].score += marksperTask[j+1];
    }
}

bool compareContestants(contestant &contestant1, contestant &contestant2)
{
    if (contestant1.score > contestant2.score)
        return true;
    else if (contestant1.score == contestant2.score)
    {
        if (contestant1.numOfQuestions > contestant2.numOfQuestions)
            return true;
        else if (contestant1.numOfQuestions == contestant2.numOfQuestions)
            return (contestant1.id < contestant2.id);
        else
            return false;
    }
    else
        return false;
}

void displayOutput()
{
    
    int pScore{}, pRank{};
    for (int i{}; i<n; i++)
        if (contestants[i].id == p)
        {
            pRank = i+1;
            pScore = contestants[i].score;
            break;
        }
    cout << pScore << ' ' << pRank << '\n';
}

int main()
{
    inputContestants();
    sort(contestants.begin(), contestants.end(), compareContestants);
    displayOutput();
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	2 ms	332 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	4 ms	432 KB	Output is correct
10	Correct	8 ms	524 KB	Output is correct
11	Correct	30 ms	1092 KB	Output is correct
12	Correct	49 ms	1624 KB	Output is correct
13	Correct	150 ms	4256 KB	Output is correct
14	Correct	211 ms	6040 KB	Output is correct
15	Correct	354 ms	13112 KB	Output is correct
16	Correct	376 ms	14048 KB	Output is correct
17	Correct	588 ms	17308 KB	Output is correct
18	Correct	637 ms	19356 KB	Output is correct
19	Correct	838 ms	23632 KB	Output is correct
20	Correct	921 ms	24388 KB	Output is correct