oj.uz

Submission #927943

# Submission time Handle Problem Language Result Execution time Memory
927943 2024-02-15T14:27:11 Z TAhmed33 Poi (IOI09_poi) C++
100 / 100
 468 ms 39548 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main () {
    int n, m, k;
    cin >> n >> m >> k;
    int arr[n + 1][m + 1] = {};
    int dif[m + 1] = {};
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> arr[i][j];
            if (!arr[i][j]) dif[j]++;
        }
    }
    vector <vector <int>> ss;
    for (int i = 1; i <= n; i++) {
        int cost = 0;
        int cnt = 0;
        for (int j = 1; j <= m; j++) {
            if (arr[i][j]) cost += dif[j], cnt++;
        }
        ss.push_back({cost, cnt, i});
    }
    sort(ss.begin(), ss.end(), [] (vector <int> a, vector <int> b) {
       if (a[0] == b[0] && a[1] == b[1]) return a[2] < b[2];
       if (a[0] == b[0]) return a[1] > b[1];
       return a[0] > b[0];
    });
    int u = 1;
    for (auto i : ss) {
        if (i[2] == k) {
            cout << i[0] << " " << u << endl;
        }
        u++;
    }
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 688 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 16 ms 1628 KB Output is correct
12 Correct 24 ms 2396 KB Output is correct
13 Correct 70 ms 6224 KB Output is correct
14 Correct 122 ms 8596 KB Output is correct
15 Correct 180 ms 15184 KB Output is correct
16 Correct 201 ms 16208 KB Output is correct
17 Correct 283 ms 23820 KB Output is correct
18 Correct 349 ms 27120 KB Output is correct
19 Correct 427 ms 35652 KB Output is correct
20 Correct 468 ms 39548 KB Output is correct