Submission #1086361

#	Time	Username	Problem	Language	Result	Execution time	Memory
1086361		steveonalex	Poi (IOI09_poi)	C++17	100 / 100	196 ms	23876 KiB

poi

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
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 T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }



int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n, t, p; cin >> n >> t >> p;
    int grid[n][t]; 
    for(int i = 0; i<n; ++i) for(int j = 0; j < t; ++j) cin >> grid[i][j];

    int cost[t]; memset(cost, 0, sizeof cost);
    for(int i = 0; i<n; ++i) for(int j = 0; j < t; ++j) cost[j] += 1 - grid[i][j];

    vector<array<int, 3>> a(n);
    for(int i= 0; i<n; ++i){
        a[i][2] = i + 1;
        for(int j = 0; j<t; ++j) if (grid[i][j]){
            a[i][0] += cost[j];
            a[i][1] += 1;
        }
    }

    sort(ALL(a), [](array<int, 3> x, array<int, 3> y){
        if (x[0] != y[0]) return x[0] > y[0];
        if (x[1] != y[1]) return x[1] > y[1];
        return x[2] < y[2];
    });

    for(int i = 0; i<n; ++i) if (a[i][2] == p){
        cout << a[i][0] << " " << i + 1 << "\n";
        break;
    }

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

• Subtask 1: 100 / 100