oj.uz

Submission #79920

# Submission time Handle Problem Language Result Execution time Memory
79920 2018-10-17T10:23:38 Z AKaan37 COCI17_cezar (COCI17_cezar) C++14
50 / 50
 3 ms 672 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR for(int i=1;i<=n;i++)
#define FOr for(int i=n;i>=1;i--)
#define pb push_back
#define mp make_pair
#define sf scanf
#define pf printf
#define lo long long
#define lim 999999999
#define LIM -999999999
#define li 100005
int n,m,cev,vis[30],cevap,ycevap;
string s;
int main(){
	for(int i=1;i<=9;i++){
		vis[i]=4;
	}
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&m);
		cev+=m;
		vis[m]--;
	}
	cev=21-cev;
	if(cev>=11){
		printf("VUCI");
		return 0;
	}
	for(int i=1;i<=9;i++){
		if(i<cev)
			cevap+=vis[i];
		else ycevap+=vis[i];
	}
	ycevap+=16;
	//~ cout<<ycevap<<"\n"<<cevap;
	if(ycevap>=cevap){
		printf("DOSTA");
		return 0;
	}
	printf("VUCI");
	return 0;
}

Compilation message

cezar.cpp: In function 'int main()':
cezar.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
cezar.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&m);
   ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 512 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 528 KB Output is correct
3 Correct 2 ms 528 KB Output is correct

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 612 KB Output is correct
2 Correct 2 ms 612 KB Output is correct
3 Correct 2 ms 672 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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