oj.uz

Submission #230474

# Submission time Handle Problem Language Result Execution time Memory
230474 2020-05-10T07:56:26 Z VEGAnn Sajam (COCI18_sajam) C++14
45 / 90
 23 ms 1408 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define pii pair<int,int>
#define pis pair<int,short>
#define ft first
#define sd second
#define MP make_pair
#define PB push_back
#define all(x) x.begin(),x.end()
using namespace std;
typedef long long ll;
const int oo = 2e9;
const int N = 1010;
int n, k, m;
char c[N][N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n >> k;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cin >> c[i][j];

    for (int i = 0; i < n; i++){
        int k0 = 0, k1 = 0;

        for (int j = 0; j < n; j++)
            if (c[0][j] == c[i][j])
                k0++;
            else k1++;

        k -= min(k0, k1);
    }

    if (k < 0)
        cout << "NE";
    else cout << "DA";

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 8 ms 768 KB Output is correct
3 Correct 9 ms 896 KB Output is correct
4 Correct 15 ms 1280 KB Output is correct
5 Correct 8 ms 896 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 21 ms 1280 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 21 ms 1280 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1152 KB Output is correct
2 Correct 14 ms 1152 KB Output is correct
3 Correct 11 ms 1024 KB Output is correct
4 Correct 10 ms 1024 KB Output is correct
5 Correct 15 ms 1280 KB Output is correct
6 Correct 10 ms 864 KB Output is correct
7 Correct 12 ms 1024 KB Output is correct
8 Correct 12 ms 1152 KB Output is correct
9 Correct 7 ms 768 KB Output is correct
10 Correct 23 ms 1280 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1280 KB Output is correct
2 Correct 15 ms 1152 KB Output is correct
3 Correct 10 ms 1024 KB Output is correct
4 Correct 12 ms 1152 KB Output is correct
5 Correct 12 ms 1072 KB Output is correct
6 Correct 17 ms 1280 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 11 ms 1024 KB Output is correct
9 Correct 15 ms 1024 KB Output is correct
10 Correct 23 ms 1408 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1024 KB Output is correct
2 Correct 10 ms 1024 KB Output is correct
3 Incorrect 19 ms 1280 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1280 KB Output is correct
2 Correct 18 ms 1280 KB Output is correct
3 Incorrect 16 ms 1280 KB Output isn't correct
4 Halted 0 ms 0 KB -