oj.uz

Submission #936951

# Submission time Handle Problem Language Result Execution time Memory
936951 2024-03-03T05:55:56 Z qwe1rt1yuiop1 Topical (NOI23_topical) C++17
12 / 100
 146 ms 35560 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
using pii = pair<int, int>;

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<vector<int>> a(n, vector<int>(k)), b = a;
    for (auto &i : a)
        for (auto &j : i)
            cin >> j;
    for (auto &i : b)
        for (auto &j : i)
            cin >> j;
    
    vector<int> cur(k, 0), flag(n, 0);
    while (1)
    {
        int ok = 0;
        for (int i = 0; i < n; ++i)
            if (!flag[i])
            {
                int okk = 1;
                for (int j = 0; j < k; ++j)
                    okk &= cur[j] >= a[i][j];
                if (okk)
                {
                    ok = flag[i] = 1;
                    break;
                }
            }
        if (!ok)
            break;
    }
    cout << accumulate(flag.begin(), flag.end(), 0LL) << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    solve();

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 856 KB Output is correct
4 Correct 118 ms 35560 KB Output is correct
5 Correct 125 ms 35460 KB Output is correct
6 Correct 146 ms 35432 KB Output is correct
7 Correct 88 ms 29640 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 2 ms 856 KB Output is correct
4 Correct 118 ms 35560 KB Output is correct
5 Correct 125 ms 35460 KB Output is correct
6 Correct 146 ms 35432 KB Output is correct
7 Correct 88 ms 29640 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Incorrect 1 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -