oj.uz

Submission #870210

# Submission time Handle Problem Language Result Execution time Memory
870210 2023-11-07T08:48:28 Z inawah Poi (IOI09_poi) C++14
100 / 100
 497 ms 11972 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

#define MAXN 2005
int p[MAXN], s[MAXN], t[MAXN], a[MAXN];
bool m[MAXN][MAXN];

bool cmp(int const &i, int const &j) {
    if (s[i] != s[j]) {
        return s[i] > s[j];
    }
    if (t[i] != t[j]) {
        return t[i] > t[j];
    }
    return i < j;
}

int main() {
    int N, T, P;
    scanf("%d %d %d\n", &N, &T, &P);
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= T; ++j) {
            cin >> m[i][j];
            p[j] += m[i][j];
            t[i] += m[i][j];
        }
    }
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= T; ++j) {
            s[i] += m[i][j] ? N - p[j] : 0;
        }
    }
    for (int i = 1; i <= N; ++i) {
        a[i] = i;
    }
    sort(a + 1, a + N + 1, &cmp);
    for (int i = 1; i <= N; ++i) {
        if (a[i] == P) {
            printf("%d %d\n", s[P], i);
        }
    }
    return 0;
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d %d %d\n", &N, &T, &P);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 4 ms 2652 KB Output is correct
11 Correct 15 ms 2916 KB Output is correct
12 Correct 24 ms 2908 KB Output is correct
13 Correct 91 ms 3796 KB Output is correct
14 Correct 101 ms 4180 KB Output is correct
15 Correct 185 ms 5840 KB Output is correct
16 Correct 216 ms 5972 KB Output is correct
17 Correct 282 ms 7892 KB Output is correct
18 Correct 332 ms 9096 KB Output is correct
19 Correct 426 ms 11352 KB Output is correct
20 Correct 497 ms 11972 KB Output is correct