oj.uz

Submission #399388

# Submission time Handle Problem Language Result Execution time Memory
399388 2021-05-05T16:18:36 Z iulia13 Poi (IOI09_poi) C++14
100 / 100
 708 ms 16140 KB 
#include <iostream>
#include <algorithm>

using namespace std;
const int nmax = 2005;
int a[nmax][nmax];
int v[nmax];
struct ura{
    int sc, id, tsk;
};
ura b[nmax];
bool cmp(ura x, ura y)
{
    if (x.sc != y.sc)
        return x.sc > y.sc;
    if (x.tsk != y.tsk)
        return x.tsk > y.tsk;
    return x.id < y.id;
}
int main()
{
    int n, t, p, i, j;
    cin >> n >> t >> p;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= t; j++)
            cin >> a[i][j], b[i].tsk += a[i][j];
    for (j = 1; j <= t; j++)
        for (i = 1; i <= n; i++)
            v[j] += (1 - a[i][j]);
    for (i = 1; i <= n; i++)
    {
        b[i].id = i;
        for (j = 1; j <= t; j++)
            b[i].sc += a[i][j] * v[j];
    }
    sort (b + 1, b + n + 1, cmp);
    for (i = 1; i <= n; i++)
        if (b[i].id == p)
        {
            cout << b[i].sc << " " << i;
            return 0;
        }
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 6 ms 1228 KB Output is correct
11 Correct 22 ms 1996 KB Output is correct
12 Correct 36 ms 3000 KB Output is correct
13 Correct 106 ms 5416 KB Output is correct
14 Correct 151 ms 7620 KB Output is correct
15 Correct 268 ms 9756 KB Output is correct
16 Correct 284 ms 10480 KB Output is correct
17 Correct 415 ms 11972 KB Output is correct
18 Correct 477 ms 13580 KB Output is correct
19 Correct 646 ms 16140 KB Output is correct
20 Correct 708 ms 15936 KB Output is correct