oj.uz

Submission #835989

# Submission time Handle Problem Language Result Execution time Memory
835989 2023-08-24T03:44:00 Z Hanksburger Poi (IOI09_poi) C++17
0 / 100
 189 ms 23744 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
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Incorrect 0 ms 328 KB Output isn't correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Incorrect 1 ms 468 KB Output isn't correct
7 Incorrect 1 ms 592 KB Output isn't correct
8 Incorrect 1 ms 596 KB Output isn't correct
9 Incorrect 2 ms 724 KB Output isn't correct
10 Incorrect 2 ms 1236 KB Output isn't correct
11 Incorrect 6 ms 2260 KB Output isn't correct
12 Incorrect 11 ms 3448 KB Output isn't correct
13 Incorrect 29 ms 6512 KB Output isn't correct
14 Incorrect 41 ms 9296 KB Output isn't correct
15 Incorrect 71 ms 12680 KB Output isn't correct
16 Incorrect 82 ms 13700 KB Output isn't correct
17 Incorrect 119 ms 16796 KB Output isn't correct
18 Incorrect 129 ms 18908 KB Output isn't correct
19 Incorrect 171 ms 23036 KB Output isn't correct
20 Incorrect 189 ms 23744 KB Output isn't correct