Submission #659788

#	Time	Username	Problem	Language	Result	Execution time	Memory
659788		PredescuSebastianIon	Ronald (COCI17_ronald)	C++11	120 / 120	30 ms	1308 KiB

ronald

#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <climits>
#include <iomanip>
#include <cmath>

using namespace std;
constexpr int nmax = 1e3+2;
int n,m,x,y;
bool a[nmax][nmax];
void change(bool a[nmax][nmax],int x)
{
    for(int i=1;i<=n;i++)
    {
        a[i][x] = (a[i][x] == true ? false:true);
        a[x][i] = (a[x][i] == true ? false:true);
    }
    return;
}
bool verificare(bool a[nmax][nmax])
{
    for(int i=1;i<=n;i++)
    {
        if(a[i][1]==false)
        {
            change(a,i);
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=i+1;j<=n;j++)
        {
            if(a[i][j]==false)
            {
                return false;
            }
        }
    }
    return true;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        a[x][y]=a[y][x]=true;
    }
    if(verificare(a)==true)
    {
        cout<<"DA"<<'\n';
        return 0;
    }
    cout<<"NE"<<'\n';
    return 0;
}

• 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