oj.uz

Submission #335585

# Submission time Handle Problem Language Result Execution time Memory
335585 2020-12-13T08:45:41 Z Joshc Poi (IOI09_poi) C++11
100 / 100
 494 ms 23916 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

int l[2001][2001], v[2001];

int main() {
    int n, t, p;
    scanf("%d%d%d", &n, &t, &p);
    for (int i=1; i<=n; i++) {
        for (int j=1; j<=t; j++) scanf("%d", &l[i][j]);
    }
    for (int i=1; i<=t; i++) {
        for (int j=1; j<=n; j++) v[i] += !l[j][i];
    }
    vector<pair<int, pair<int, int> > > x;
    for (int i=1; i<=n; i++) {
        int a=0, b=0;
        for (int j=1; j<=t; j++) {
            a += l[i][j]*v[j];
            b += l[i][j];
        }
        x.push_back({-a, {-b, i}});
    }
    sort(x.begin(), x.end());
    for (int i=0; i<n; i++) {
        if (x[i].second.second == p) printf("%d %d\n", -x[i].first, i+1);
    }
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |     scanf("%d%d%d", &n, &t, &p);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
poi.cpp:12:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 |         for (int j=1; j<=t; j++) scanf("%d", &l[i][j]);
      |                                  ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 3 ms 748 KB Output is correct
10 Correct 4 ms 1260 KB Output is correct
11 Correct 15 ms 2284 KB Output is correct
12 Correct 30 ms 3564 KB Output is correct
13 Correct 70 ms 6636 KB Output is correct
14 Correct 100 ms 9324 KB Output is correct
15 Correct 180 ms 12780 KB Output is correct
16 Correct 200 ms 13676 KB Output is correct
17 Correct 300 ms 16748 KB Output is correct
18 Correct 345 ms 19052 KB Output is correct
19 Correct 453 ms 23244 KB Output is correct
20 Correct 494 ms 23916 KB Output is correct