oj.uz

Submission #535691

# Submission time Handle Problem Language Result Execution time Memory
535691 2022-03-10T23:48:38 Z colazcy Ronald (COCI17_ronald) C++17
120 / 120
 44 ms 3156 KB 
#include <cstdio>
#include <cassert>
#define let const auto
#define rep(name,beg,end) for(auto lim_##name = end,name = beg;name <= lim_##name;name++)
#define per(name,beg,end) for(auto lim_##name = end,name = beg;name >= lim_##name;name--)
#define repn(lim) for(auto REPN_lIM = lim,REPN = 1;REPN <= REPN_lIM;REPN++)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define trace() debug("line : %d, Function : %s\n",__LINE__,__FUNCTION__)
constexpr int maxn = 1e3 + 10;

int n,m;
bool now[maxn],g[maxn][maxn];
bool chk(const int beg){
	now[1] = beg;
	rep(i,1,n)now[i] = now[1] ^ g[1][i];
	rep(u,1,n)
		rep(v,1,n)
			if((now[u] ^ now[v]) != g[u][v])return false;
	return true;
}
int main(){
	// std::freopen("ronald.in","r",stdin);
	// std::freopen("ronald.out","w",stdout);
	std::scanf("%d",&n);
	rep(u,1,n)
		rep(v,1,n)
			if(u != v)
				g[u][v] = true;
	std::scanf("%d",&m);
	repn(m){
		int u,v; std::scanf("%d %d",&u,&v);
		g[u][v] ^= 1;
		g[v][u] ^= 1;
	}
	if(chk(0))return std::puts("DA"),0;
	if(chk(1))return std::puts("DA"),0;
	std::puts("NE");		
	std::fclose(stdin);
	std::fclose(stdout);
	return 0;
}

Compilation message

ronald.cpp: In function 'int main()':
ronald.cpp:24:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  std::scanf("%d",&n);
      |  ~~~~~~~~~~^~~~~~~~~
ronald.cpp:29:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |  std::scanf("%d",&m);
      |  ~~~~~~~~~~^~~~~~~~~
ronald.cpp:31:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |   int u,v; std::scanf("%d %d",&u,&v);
      |            ~~~~~~~~~~^~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 292 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 292 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 292 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 404 KB Output is correct
4 Correct 1 ms 304 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 564 KB Output is correct
2 Correct 12 ms 1364 KB Output is correct
3 Correct 4 ms 724 KB Output is correct
4 Correct 3 ms 596 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 8 ms 1072 KB Output is correct
3 Correct 31 ms 2396 KB Output is correct
4 Correct 44 ms 3156 KB Output is correct