제출 #1104261

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104261		TrinhKhanhDung	Poi (IOI09_poi)	C++14	0 / 100	173 ms	21800 KiB

poi

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(), v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define INF (ll)1e9
#define oo (ll)1e18
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 2003;

int N, T, ID;
int a[MAX][MAX], points[MAX];

void input(){
    cin >> N >> T >> ID;
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= T; j++){
            cin >> a[i][j];
            points[j] += (a[i][j] == 0);
        }
    }
}

void solve(){
    vector<array<int, 3>> ord;
    for(int i = 1; i <= N; i++){
        int score = 0, cnt = 0;
        for(int j = 1; j <= T; j++){
            if(a[i][j]){
                score += points[j];
                cnt++;
            }
        }
        ord.push_back({score, cnt, i});
    }

    sort(ALL(ord));
    for(int i = 0; i < N; i++){
        if(ord[i][2] == ID){
            cout << ord[i][0] << ' ' << i + 1 << '\n';
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("creature.inp", "r", stdin);
//    freopen("creature.out", "w", stdout);

    input();
    solve();

    return 0;
}

• Subtask 1: 0 / 100