Submission #382122

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
382122	2021-03-26T12:30:23 Z	vishesh312	Poi (IOI09_poi)	C++17	100 / 100	296 ms	16108 KB

poi

#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

void solve(int tc) {
    int n, m, p;
    cin >> n >> m >> p;
    vector<vector<int>> v(n, vector<int>(m));
    vector<int> point(m), score(n), cnt(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> v[i][j];
            point[j] += (v[i][j] == 0);
            cnt[i] += v[i][j];
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (v[i][j]) score[i] += point[j];
        }
    }
    vector<array<int, 3>> res(n);
    for (int i = 0; i < n; ++i) {
        res[i] = {-score[i], -cnt[i], i};
    }
    sort(all(res));
    int i = 0;
    while (res[i][2] != p-1) ++i;
    cout << -res[i][0] << " " << i+1 << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	3 ms	364 KB	Output is correct
10	Correct	3 ms	492 KB	Output is correct
11	Correct	10 ms	876 KB	Output is correct
12	Correct	19 ms	1132 KB	Output is correct
13	Correct	53 ms	2668 KB	Output is correct
14	Correct	67 ms	3820 KB	Output is correct
15	Correct	120 ms	6316 KB	Output is correct
16	Correct	130 ms	6892 KB	Output is correct
17	Correct	188 ms	9864 KB	Output is correct
18	Correct	220 ms	11128 KB	Output is correct
19	Correct	286 ms	14584 KB	Output is correct
20	Correct	296 ms	16108 KB	Output is correct