oj.uz

Submission #924796

# Submission time Handle Problem Language Result Execution time Memory
924796 2024-02-09T16:55:11 Z boris_mihov Poi (IOI09_poi) C++17
100 / 100
 176 ms 24152 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 2000 + 10;
const int INF  = 1e9;

int n, m, p;
int sum[MAXN];
int score[MAXN];
int cntTasks[MAXN];
int a[MAXN][MAXN];
int order[MAXN];

void solve()
{
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= m ; ++j)
        {
            sum[j] += !a[i][j];
        }
    }
    
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= m ; ++j)
        {
            score[i] += (a[i][j] == 1) * sum[j];
            cntTasks[i] += (a[i][j] == 1);
        }
    }

    std::iota(order + 1, order + 1 + n, 1);
    std::sort(order + 1, order + 1 + n, [&](int x, int y)
    {
        return score[x] > score[y] || (score[x] == score[y] && cntTasks[x] > cntTasks[y]) || (score[x] == score[y] && cntTasks[x] == cntTasks[y] && x < y);
    });

    for (int i = 1 ; i <= n ; ++i)
    {
        if (order[i] == p)
        {
            std::cout << score[p] << ' ' << i << '\n';
            return;
        }
    }

    assert(false);
}

void input()
{
    std::cin >> n >> m >> p;
    for (int i = 1 ; i <= n ; ++i)
    {
        for (int j = 1 ; j <= m ; ++j)
        {
            std::cin >> a[i][j];
        }
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}   

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 756 KB Output is correct
5 Correct 1 ms 2440 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2516 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 6 ms 4924 KB Output is correct
12 Correct 10 ms 4956 KB Output is correct
13 Correct 26 ms 7888 KB Output is correct
14 Correct 38 ms 10320 KB Output is correct
15 Correct 67 ms 13792 KB Output is correct
16 Correct 76 ms 14052 KB Output is correct
17 Correct 109 ms 17488 KB Output is correct
18 Correct 118 ms 20312 KB Output is correct
19 Correct 156 ms 23132 KB Output is correct
20 Correct 176 ms 24152 KB Output is correct