oj.uz

Submission #835990

# Submission time Handle Problem Language Result Execution time Memory
835990 2023-08-24T03:45:47 Z Hanksburger Poi (IOI09_poi) C++17
100 / 100
 182 ms 15996 KB 
#include <bits/stdc++.h>
using namespace std;
pair<pair<int, int>, int> a[2005];
int x[2005][2005], s[2005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            cin >> x[i][j];
            if (!x[i][j])
                s[j]++;
        }
    }
    for (int i=1; i<=n; i++)
    {
        a[i].second=i;
        for (int j=1; j<=m; j++)
        {
            if (x[i][j])
            {
                a[i].first.first-=s[j];
                a[i].first.second--;
            }
        }
    }
    sort(a+1, a+n+1);
    for (int i=1; i<=n; i++)
        if (a[i].second==k)
            cout << -a[i].first.first << ' ' << i;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 2 ms 1184 KB Output is correct
11 Correct 6 ms 2004 KB Output is correct
12 Correct 10 ms 3016 KB Output is correct
13 Correct 29 ms 5464 KB Output is correct
14 Correct 41 ms 7604 KB Output is correct
15 Correct 75 ms 9644 KB Output is correct
16 Correct 77 ms 10508 KB Output is correct
17 Correct 138 ms 11980 KB Output is correct
18 Correct 142 ms 13568 KB Output is correct
19 Correct 164 ms 15972 KB Output is correct
20 Correct 182 ms 15996 KB Output is correct