제출 #246195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246195		Vimmer	Ronald (COCI17_ronald)	C++14	0 / 120	45 ms	3320 KiB

ronald

#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 pf push_front
#define N 100100
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 6> a6;

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


bool mk[1005], swaper[1005], g[1005][1005];

int n, m;

void dfs(int v, int p)
{
    mk[v] = 1;

    for (int i = 0; i < n; i++)
    {
        if (i == v) continue;

        if (mk[i])
        {
            bool f;

            if (swaper[v]) swaper[i] = g[v][i]; else swaper[i] = !g[v][i];

            if (f != swaper[i]) {cout << "NE" << endl; exit(0);}

            continue;
        }

        if (swaper[v]) swaper[i] = g[v][i]; else swaper[i] = !g[v][i];

        dfs(i, v);
    }
}
int main()
{
    ////freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

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

    cin >> n >> m;

    for (int i = 0; i < m; i++)
    {
        int x, y;

        cin >> x >> y;

        g[x][y] = 1;

        g[y][x] = 1;
    }

    dfs(1, -1);

    cout << "DA" << endl;
}

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

ronald.cpp: In function 'void dfs(int, int)':
ronald.cpp:49:13: warning: 'f' may be used uninitialized in this function [-Wmaybe-uninitialized]
             if (f != swaper[i]) {cout << "NE" << endl; exit(0);}
             ^~

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 15
• Subtask 7: 0 / 15
• Subtask 8: 0 / 15