답안 #382115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
382115	2021-03-26T12:23:57 Z	vishesh312	Poi (IOI09_poi)	C++17	10 / 100	297 ms	16236 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(res.rbegin(), res.rend());
    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

10.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	364 KB	Output isn't correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Incorrect	1 ms	364 KB	Output isn't correct
5	Incorrect	1 ms	364 KB	Output isn't correct
6	Incorrect	1 ms	364 KB	Output isn't correct
7	Incorrect	1 ms	364 KB	Output isn't correct
8	Incorrect	1 ms	364 KB	Output isn't correct
9	Incorrect	2 ms	364 KB	Output isn't correct
10	Incorrect	3 ms	492 KB	Output isn't correct
11	Incorrect	11 ms	876 KB	Output isn't correct
12	Incorrect	16 ms	1132 KB	Output isn't correct
13	Incorrect	46 ms	2668 KB	Output isn't correct
14	Incorrect	64 ms	3692 KB	Output isn't correct
15	Incorrect	112 ms	6316 KB	Output isn't correct
16	Incorrect	122 ms	6892 KB	Output isn't correct
17	Incorrect	180 ms	9836 KB	Output isn't correct
18	Incorrect	202 ms	11244 KB	Output isn't correct
19	Incorrect	270 ms	14700 KB	Output isn't correct
20	Incorrect	297 ms	16236 KB	Output isn't correct