oj.uz

Submission #230429

# Submission time Handle Problem Language Result Execution time Memory
230429 2020-05-10T06:33:36 Z kartel Sajam (COCI18_sajam) C++14
0 / 90
 26 ms 4344 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int a[N][N], i, j, n, k, p;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> k;
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
    {
        char c;
        cin >> c;
        a[i][j] = (c == 'x') ? 1 : 0;
    }

    for (p = 1; p <= n; p++)
    {
        for (i = 1; i <= n; i++)
        {
            int kol = 0;

            for (j = 1; j <= n; j++) if (a[i][j] == 0) kol++;

            if (2 * kol > n)
                for (j = 1; j <= n; j++) a[i][j] = a[i][j] ^ 1;
        }

        for (j = 1; j <= n; j++)
        {
            int kol = 0;

            for (i = 1; i <= n; i++) if (a[i][j] == 0) kol++;

            if (2 * kol > n)
                for (i = 1; i <= n; i++) a[i][j] = a[i][j] ^ 1;
        }


        int kol = 0;

        for (i = 1; i <= n; i++)
            for (j = 1; j <= n; j++) kol += a[i][j];

        if (n - kol <= k)
        {
            cout << "DA";
            return 0;
        }
    }
    cout << "NE";
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 9 ms 2048 KB Output is correct
3 Correct 10 ms 2432 KB Output is correct
4 Correct 21 ms 3968 KB Output is correct
5 Correct 10 ms 2428 KB Output is correct
6 Correct 7 ms 1664 KB Output is correct
7 Incorrect 10 ms 2304 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 3328 KB Output is correct
2 Correct 19 ms 3620 KB Output is correct
3 Correct 14 ms 2944 KB Output is correct
4 Correct 13 ms 2816 KB Output is correct
5 Correct 21 ms 3840 KB Output is correct
6 Incorrect 11 ms 2432 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3840 KB Output is correct
2 Correct 19 ms 3712 KB Output is correct
3 Correct 13 ms 2816 KB Output is correct
4 Correct 16 ms 3200 KB Output is correct
5 Correct 17 ms 3328 KB Output is correct
6 Incorrect 23 ms 4096 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2892 KB Output is correct
2 Correct 14 ms 2944 KB Output is correct
3 Correct 26 ms 4224 KB Output is correct
4 Correct 11 ms 2560 KB Output is correct
5 Correct 13 ms 2944 KB Output is correct
6 Incorrect 24 ms 4096 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 4344 KB Output is correct
2 Correct 23 ms 4096 KB Output is correct
3 Correct 24 ms 4096 KB Output is correct
4 Correct 15 ms 3200 KB Output is correct
5 Correct 16 ms 3200 KB Output is correct
6 Incorrect 16 ms 3456 KB Output isn't correct
7 Halted 0 ms 0 KB -