oj.uz

Submission #985647

# Submission time Handle Problem Language Result Execution time Memory
985647 2024-05-18T12:17:24 Z AliHasanli Topical (NOI23_topical) C++17
12 / 100
 387 ms 12116 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,k,ans=0;
    cin>>n>>k;
    int r[n][k],u[n][k];
    for(int i=0;i<n;i++)
        for(int j=0;j<k;j++)
            cin>>r[i][j];
    for(int i=0;i<n;i++)
        for(int j=0;j<k;j++)
            cin>>u[i][j];
    int p[k]={0},used[n]={0};
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        {
            if(used[j])continue;
            bool check=1;
            for(int g=0;g<k;g++)
                if(p[g]<r[j][g]){check=0;break;}
            if(check)
            {
                used[j]=1;
                ans++;
                for(int g=0;g<k;g++)
                p[g]+=u[j][g];
            }
        }
    cout<<ans;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 383 ms 12116 KB Output is correct
5 Correct 387 ms 12116 KB Output is correct
6 Correct 381 ms 12116 KB Output is correct
7 Correct 263 ms 12084 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 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 5 ms 604 KB Output isn't correct
8 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 Correct 0 ms 348 KB Output is correct
3 Incorrect 60 ms 520 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Correct 383 ms 12116 KB Output is correct
5 Correct 387 ms 12116 KB Output is correct
6 Correct 381 ms 12116 KB Output is correct
7 Correct 263 ms 12084 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Incorrect 5 ms 604 KB Output isn't correct
15 Halted 0 ms 0 KB -