oj.uz

Submission #230427

# Submission time Handle Problem Language Result Execution time Memory
230427 2020-05-10T06:27:12 Z Vimmer Sajam (COCI18_sajam) C++14
90 / 90
 22 ms 3456 KB 
#include <bits/stdc++.h>

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100005
#define MOD ll(998244353)

using namespace std;

//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;

typedef short int si;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int main()
{
   // freopen("input.txt", "r", stdin);// freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, k;

    cin >> n >> k;

    string a[n], b[n];

    for (int i = 0; i < n; i++) {cin >> a[i]; b[i] = a[i];}

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

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

        if (kol + kol > n)
            for (int j = 0; j < n; j++) if (a[i][j] == 'x') a[i][j] = 'o'; else a[i][j] = 'x';
    }

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

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

        if (kol + kol > n)
            for (int i = 0; i < n; i++) if (a[i][j] == 'x') a[i][j] = 'o'; else a[i][j] = 'x';
    }

    int ans1 = 0;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) if (a[i][j] == 'x') ans1++;

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

        for (int i = 0; i < n; i++) if (b[i][j] == 'x') kol++;

        if (kol + kol > n)
            for (int i = 0; i < n; i++) if (b[i][j] == 'x') b[i][j] = 'o'; else b[i][j] = 'x';
    }

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

        for (int j = 0; j < n; j++) if (b[i][j] == 'x') kol++;

        if (kol + kol > n)
            for (int j = 0; j < n; j++) if (b[i][j] == 'x') b[i][j] = 'o'; else b[i][j] = 'x';
    }

    int ans2 = 0;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) if (b[i][j] == 'x') ans2++;

    cout << (min(ans1, ans2) <= k ? "DA" : "NE");
}

Compilation message

sajam.cpp: In function 'int main()':
sajam.cpp:51:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
         if (kol + kol > n)
            ^
sajam.cpp:61:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
         if (kol + kol > n)
            ^
sajam.cpp:76:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
         if (kol + kol > n)
            ^
sajam.cpp:86:12: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
         if (kol + kol > n)
            ^

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 896 KB Output is correct
3 Correct 10 ms 1280 KB Output is correct
4 Correct 18 ms 2944 KB Output is correct
5 Correct 9 ms 1152 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 8 ms 1152 KB Output is correct
8 Correct 17 ms 2944 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 17 ms 3072 KB Output is correct

Subtask #2
15.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 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2048 KB Output is correct
2 Correct 16 ms 2560 KB Output is correct
3 Correct 13 ms 1920 KB Output is correct
4 Correct 11 ms 1664 KB Output is correct
5 Correct 18 ms 2816 KB Output is correct
6 Correct 9 ms 1280 KB Output is correct
7 Correct 14 ms 2048 KB Output is correct
8 Correct 15 ms 2176 KB Output is correct
9 Correct 7 ms 896 KB Output is correct
10 Correct 19 ms 3328 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2688 KB Output is correct
2 Correct 17 ms 2560 KB Output is correct
3 Correct 12 ms 1664 KB Output is correct
4 Correct 14 ms 2048 KB Output is correct
5 Correct 14 ms 2176 KB Output is correct
6 Correct 20 ms 3200 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 13 ms 1920 KB Output is correct
9 Correct 12 ms 2048 KB Output is correct
10 Correct 19 ms 3456 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1664 KB Output is correct
2 Correct 11 ms 1664 KB Output is correct
3 Correct 20 ms 3328 KB Output is correct
4 Correct 10 ms 1280 KB Output is correct
5 Correct 11 ms 1664 KB Output is correct
6 Correct 20 ms 3200 KB Output is correct
7 Correct 9 ms 1280 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 9 ms 1408 KB Output is correct
10 Correct 9 ms 1280 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 3328 KB Output is correct
2 Correct 20 ms 3200 KB Output is correct
3 Correct 19 ms 2944 KB Output is correct
4 Correct 13 ms 2048 KB Output is correct
5 Correct 13 ms 2048 KB Output is correct
6 Correct 14 ms 2176 KB Output is correct
7 Correct 9 ms 1280 KB Output is correct
8 Correct 17 ms 2688 KB Output is correct
9 Correct 10 ms 1664 KB Output is correct
10 Correct 18 ms 3200 KB Output is correct