oj.uz

Submission #221798

# Submission time Handle Problem Language Result Execution time Memory
221798 2020-04-11T07:53:08 Z patrikpavic2 Poi (IOI09_poi) C++17
100 / 100
 417 ms 31864 KB 
/**
* user:  ppavic
* fname: Patrik
* lname: Pavić
* task:  poi
* score: 100.0
* date:  2019-05-11 07:47:44.386747
*/
#include <cstdio>
#include <vector>
#include <algorithm>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef pair < int, int > pii;
typedef pair < int , pii > pip;

const int N = 3050;

int n, t, p, sc[N], A[N][N];
vector < pip > v;

int main(){
    scanf("%d%d%d", &n, &t, &p);
    for(int i = 0;i < n;i++){
        for(int j = 0;j < t;j++){
            scanf("%d", &A[i][j]);
            sc[j] += !A[i][j];
        }
    }
    for(int i = 0;i < n;i++){
        int cur = 0, cnt = 0;
        for(int j = 0;j < t;j++)
            cur += A[i][j] * sc[j], cnt += A[i][j];
        v.PB({-cur, {-cnt, i + 1}});
        if(i + 1 == p) printf("%d ", cur);
    }
    sort(v.begin(), v.end());
    for(int i = 0;i < n;i++){
        if(v[i].Y.Y == p)
            printf("%d\n", i + 1);
    }
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &t, &p);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
poi.cpp:31:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &A[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 5 ms 512 KB Output is correct
7 Correct 5 ms 640 KB Output is correct
8 Correct 5 ms 640 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 8 ms 1280 KB Output is correct
11 Correct 18 ms 2176 KB Output is correct
12 Correct 29 ms 3448 KB Output is correct
13 Correct 72 ms 6732 KB Output is correct
14 Correct 94 ms 9336 KB Output is correct
15 Correct 175 ms 13944 KB Output is correct
16 Correct 204 ms 15096 KB Output is correct
17 Correct 266 ms 20512 KB Output is correct
18 Correct 293 ms 23160 KB Output is correct
19 Correct 414 ms 29560 KB Output is correct
20 Correct 417 ms 31864 KB Output is correct