| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1275621 | cjspd_oly | Poi (IOI09_poi) | C++17 | 172 ms | 31912 KiB | 
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using vii = vector<pii>;
using vvii = vector<vii>;
using l = long long;
using vl = vector<l>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using pll = pair<l, l>;
using vll = vector<pll>;
using vvll = vector<vll>;
using d = double;
using vd = vector<d>;
using vvd = vector<vd>;
using vvvd = vector<vvd>;
using ld = long double;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pbb = pair<bool, bool>;
using vbb = vector<pbb>;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
void setIO(string name = "")
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if (!name.empty())
    {
        (void)freopen((name + ".in").c_str(), "r", stdin);
        (void)freopen((name + ".out").c_str(), "w", stdout);
    }
}
const ld pi = 3.14159265358979323846;
const l LINF = 1e18;
const l INF = 1e9;
const l MOD = 1e9 + 7;
// const l MOD = 998244353;
const l MAXN = 1e3 + 5;
vl worth(MAXN, 0), solvedCnt(MAXN, 0);
void solve()
{
    int N, T, P;
    cin >> N >> T >> P;
    vvl solved(N, vl(T));
    for (int i = 0; i < N; ++i)
    {
        for (int j = 0; j < T; ++j)
        {
            cin >> solved[i][j];
            if (solved[i][j])
                ++solvedCnt[i];
            else
                ++worth[j]; // count unsolved
        }
    }
    vector<tuple<l, l, l>> res(N);
    for (int i = 0; i < N; ++i)
    {
        int score = 0;
        for (int j = 0; j < T; ++j)
            if (solved[i][j])
                score += worth[j];
        res[i] = {-score, -solvedCnt[i], i}; // * negate for desc sort
    }
    sort(all(res));
    for (int rank = 0; rank < N; ++rank)
    {
        auto [negScore, negCnt, id] = res[rank];
        if (id == P - 1)
        {
            cout << -negScore << " " << rank + 1 << "\n";
            return;
        }
    }
}
int main()
{
    setIO("");
#ifndef ONLINE_JUDGE
    // setIO("filename");
#endif
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
