oj.uz

Submission #252339

# Submission time Handle Problem Language Result Execution time Memory
252339 2020-07-25T10:08:55 Z SamAnd Poi (IOI09_poi) C++17
100 / 100
 452 ms 23892 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 2003;
struct ban
{
    int i, q, s;
    ban()
    {
        i = q = s = 0;
    }
};
bool operator<(const ban& a, const ban& b)
{
    if (a.s > b.s)
        return true;
    if (a.s < b.s)
        return false;
    if (a.q > b.q)
        return true;
    if (a.q < b.q)
        return false;
    return a.i < b.i;
}

int n, m, p;
int a[N][N];

int u[N];

ban b[N];

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    #endif // SOMETHING
    scanf("%d%d%d", &n, &m, &p);
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
            scanf("%d", &a[i][j]);
    }
    for (int j = 1; j <= m; ++j)
        u[j] = n;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
            u[j] -= a[i][j];
    }
    for (int i = 1; i <= n; ++i)
    {
        b[i].i = i;
        for (int j = 1; j <= m; ++j)
        {
            b[i].q += a[i][j];
            if (a[i][j])
                b[i].s += u[j];
        }
    }
    sort(b + 1, b + n + 1);
    for (int i = 1; i <= n; ++i)
    {
        if (b[i].i == p)
        {
            printf("%d %d\n", b[i].s, i);
        }
    }
    return 0;
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &p);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
poi.cpp:41:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &a[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 4 ms 768 KB Output is correct
10 Correct 4 ms 1280 KB Output is correct
11 Correct 14 ms 2304 KB Output is correct
12 Correct 26 ms 3584 KB Output is correct
13 Correct 69 ms 6648 KB Output is correct
14 Correct 95 ms 9336 KB Output is correct
15 Correct 173 ms 12668 KB Output is correct
16 Correct 186 ms 13688 KB Output is correct
17 Correct 275 ms 16760 KB Output is correct
18 Correct 310 ms 18936 KB Output is correct
19 Correct 408 ms 23160 KB Output is correct
20 Correct 452 ms 23892 KB Output is correct