제출 #1198077

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1198077		AMel0n	Poi (IOI09_poi)	C++20	100 / 100	143 ms	9572 KiB

poi

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define FOR(i,N) for(ll i = 0; i < N; i++)
#define all(x) (x).begin(), (x).end()
#define F first 
#define S second

signed main() {
    cin.tie(0); ios::sync_with_stdio(false);
    int N, T, P;
    cin >> N >> T >> P;
    P--;
    vector<int> task(T);
    vector<vector<int>> solved(N);
    FOR(i, N) {
        FOR(j, T) {
            int bruh;
            cin >> bruh;
            if (bruh) solved[i].push_back(j);
            else task[j]++; 
        }
    }
    vector<int> score(N);
    FOR(i, N) {
        for(auto t: solved[i]) {
            score[i] += task[t];
        }
    }
    int res = 0;
    FOR(i, N) {
        if (score[i] > score[P]) res++;
        if (score[i] == score[P] && solved[i].size() > solved[P].size()) res++;
        if (score[i] == score[P] && solved[i].size() == solved[P].size() && i < P) res++;
    }
    cout << score[P] << endl << res + 1;
}

• Subtask 1: 100 / 100