제출 #921535

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921535		josanneo22	Poi (IOI09_poi)	C++17	100 / 100	187 ms	16212 KiB

poi

#pragma warning(suppress : 4996)
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

#define L(i,j,k) for(int i=(j);i<=(k);++i)
#define R(i,j,k) for(int i=(j);i>=(k);--i)
#define all(x) x.begin(),x.end()
#define me(x,a) memset(x,a,sizeof(x))


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    int N, M; int id; cin >> N >> M >> id;
    vector<i64> people_not_scoring(M + 1, N);
    vector<vector<int>> a(N + 1, vector<int>(M + 1));
    L(i, 1, N) {
        L(j, 1, M) {
            cin >> a[i][j];
            people_not_scoring[j] -= (a[i][j] == 1);
        }
    }
    vector<i64> score(N + 1);
    vector<int> number_of_AC(N + 1);
    L(i, 1, N) L(j, 1, M) {
        score[i] += 1LL * a[i][j] * people_not_scoring[j];
        if(a[i][j]) number_of_AC[i]++;
    }
    vector<int> ord(N); iota(all(ord), 1);
    sort(all(ord), [&](int i, int j) {
        if (score[i] != score[j]) return score[i] > score[j];
        else if (number_of_AC[i] != number_of_AC[j]) return number_of_AC[i] > number_of_AC[j];
        return  i < j;
    });

    L(i, 0, N - 1) {
        if (ord[i] == id) {
            cout << score[id] << ' ' << i + 1 << '\n';
            return 0;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

poi.cpp:1: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    1 | #pragma warning(suppress : 4996)
      |

• Subtask 1: 100 / 100