Submission #522418

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
522418	2022-02-04T23:26:55 Z	nurlitadf	Poi (IOI09_poi)	C++17	100 / 100	562 ms	23680 KB

poi

#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
ll modexp(ll b, ll e, ll m){
    ll r = 1;
    while(e > 0){
     if((e & 1) == 1){
         r = (r * b) % m;
     }
     e >>= 1;
     b = (b * b) % m;
    }
    return r;
}
 
bool isvowel(char ch) { 
    return (ch == 'a') || (ch == 'e') ||(ch == 'i') ||(ch == 'o') ||(ch == 'u') ||(ch == 'y'); 
}

typedef struct {
    int score, cnt, id;
} result;

bool cmp(result a, result b) {
    if(a.score > b.score)
        return true;
    if(a.score < b.score)
        return false;
    if(a.cnt > b.cnt)
        return true;
    if(a.cnt < b.cnt)
        return false;
    if(a.id < b.id)
        return true;
    return false;
}
 
int main() {
    int n, t, p;
    cin >> n >> t >> p;

    p--;

    vector<vector<int> > status(n);
    vector<int> score(t, 0);
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < t; j++) {
            int v;
            cin >> v;

            status[i].push_back(v);

            if(!v)
                score[j]++;
        }
    }

    vector<result> scores;
    for(int i = 0; i < n; i++) {
        int sum = 0;
        int cnt = 0;
        for(int j = 0; j < t; j++) {
            if(status[i][j]) {
                sum += score[j];
                cnt++;
            }
        }

        scores.push_back({sum, cnt, i});
    }

    sort(scores.begin(), scores.end(), cmp);

    for(int i = 0; i < scores.size(); i++) {
        if(scores[i].id == p) {
            cout << scores[i].score << " " << i + 1 << endl;
            break;
        }
    }

    return 0;
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:75:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<result>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i = 0; i < scores.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	292 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	1 ms	332 KB	Output is correct
8	Correct	1 ms	248 KB	Output is correct
9	Correct	4 ms	460 KB	Output is correct
10	Correct	5 ms	460 KB	Output is correct
11	Correct	17 ms	1072 KB	Output is correct
12	Correct	28 ms	1604 KB	Output is correct
13	Correct	83 ms	4180 KB	Output is correct
14	Correct	121 ms	5956 KB	Output is correct
15	Correct	209 ms	12868 KB	Output is correct
16	Correct	224 ms	13912 KB	Output is correct
17	Correct	335 ms	17076 KB	Output is correct
18	Correct	378 ms	19392 KB	Output is correct
19	Correct	502 ms	23360 KB	Output is correct
20	Correct	562 ms	23680 KB	Output is correct