제출 #228152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
228152		blacktulip	Football (info1cup20_football)	C++17	42 / 100	49 ms	512 KiB

football

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long lo;
typedef pair< lo,lo > PII;
 
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
 
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
 
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;

int32_t main(void){
	scanf("%lld",&t);
	while(t--){
		scanf("%lld %lld",&n,&k);
		cev=0;
		for(int i=1;i<=n;i++){
			scanf("%lld",&a[i]);
			cev+=a[i];
		}
		if(k==2 || k==3){
			if(cev%2==1){printf("1");continue;}
			//~ if(cev==n){printf("0");continue;}
			int cev1=0;
			for(int i=1;i<=n;i++){
				cev1+=a[i]/2;
			}
			if(cev1%2==1){printf("1");continue;}
			printf("0");continue;
		}
		if(k==1){
			if(cev%2==0){
				printf("0");
			}
			else printf("1");
			continue;
		}
		int cev1=0,cev2=0;
		for(int i=1;i<=n;i++){
			cev1+=a[i]/2;
			cev2+=a[i]/4;
		}
		if(cev1%2==1 || cev2%2==1){printf("1");continue;}
		printf("0");continue;
	}
	return 0;
}
 

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

football.cpp: In function 'int32_t main()':
football.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&t);
  ~~~~~^~~~~~~~~~~
football.cpp:34:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&n,&k);
   ~~~~~^~~~~~~~~~~~~~~~~~~
football.cpp:37:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld",&a[i]);
    ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 26 / 26
• Subtask 2: 0 / 8
• Subtask 3: 0 / 11
• Subtask 4: 0 / 8
• Subtask 5: 0 / 16
• Subtask 6: 16 / 16
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8