제출 #230427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
230427		Vimmer	Sajam (COCI18_sajam)	C++14	90 / 90	22 ms	3456 KiB

sajam

#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");
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 15
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 15 / 15
• Subtask 6: 15 / 15