Submission #23090

#	Time	Username	Problem	Language	Result	Execution time	Memory
23090		model_code	Ronald (COCI17_ronald)	C++11	120 / 120	59 ms	9992 KiB

ronald

#include <iostream>
using namespace std;

const int N = 1000;
int n, m;
int a[N][N];
int b[N][N];

void flip(int a[N][N], int x) {
    for (int i = 0; i < n; ++i)
        a[i][x] = a[x][i] = 1 - a[i][x];
}

bool probaj(int a[N][N]) {
    for (int x = 1; x < n; ++x)
        if (a[x][0] == 0)
            flip(a, x);
    for (int i = 0; i < n; ++i)
        for (int j = i + 1; j < n; ++j)
            if (a[i][j] == 0)
                return false;
    return true;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int x, y;
        cin >> x >> y;
        --x;
        --y;
        a[x][y] = a[y][x] = 1;
        b[x][y] = b[y][x] = 1;
    }
    if (probaj(a)) {
        cout << "DA" << endl;
        return 0;
    }
    flip(b, 0);
    if (probaj(b))
        cout << "DA" << endl;
    else
        cout << "NE" << endl;
}

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