Submission #8844364


Source Code Expand

// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<complex>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
}
// ここから編集しろ

int main(){
	int a;scanf("%d",&a);
	int t=0;
	while(a--){
		int x,y,z;scanf("%d%d%d",&x,&y,&z);
		int lx=x;
		int ly=y;
		int lz=z;
		int rx=x;
		int ry=y;
		int rz=z;
		int b;scanf("%d",&b);
		while(b--){
			int p,q,r;scanf("%d%d%d",&p,&q,&r);
			lx=min(lx,p);
			ly=min(ly,q);
			lz=min(lz,r);
			rx=min(rx,x-1-p);
			ry=min(ry,y-1-q);
			rz=min(rz,z-1-r);
			
		}
		t^=lx^ly^lz^rx^ry^rz;
	}
	if(t)printf("WIN\n");
	else printf("LOSE\n");
}

Submission Info

Submission Time
Task C - 笑いをとれるかな?
User tozangezan
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2481 Byte
Status AC
Exec Time 30 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:90:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a;scanf("%d",&a);
                      ^
./Main.cpp:93:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int x,y,z;scanf("%d%d%d",&x,&y,&z);
                                     ^
./Main.cpp:100:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int b;scanf("%d",&b);
                       ^
./Main.cpp:102:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    int p,q,r;scanf("%d%d%d",&p,&q,&r);
                                      ^

Judge Result

Set Name part1 part2
Score / Max Score 30 / 30 70 / 70
Status
AC × 36
AC × 69
Set Name Test Cases
part1 small/small_00_sample_01.txt, small/small_00_sample_02.txt, small/small_01_rand_00.txt, small/small_01_rand_01.txt, small/small_01_rand_02.txt, small/small_01_rand_03.txt, small/small_01_rand_04.txt, small/small_01_rand_05.txt, small/small_01_rand_06.txt, small/small_01_rand_07.txt, small/small_01_rand_08.txt, small/small_01_rand_09.txt, small/small_02_maxrand_00.txt, small/small_02_maxrand_01.txt, small/small_02_maxrand_02.txt, small/small_02_maxrand_03.txt, small/small_02_maxrand_04.txt, small/small_02_maxrand_05.txt, small/small_02_maxrand_06.txt, small/small_02_maxrand_07.txt, small/small_02_maxrand_08.txt, small/small_02_maxrand_09.txt, small/small_03_max_00.txt, small/small_03_max_01.txt, small/small_04_loserand_00.txt, small/small_04_loserand_01.txt, small/small_04_loserand_02.txt, small/small_04_loserand_03.txt, small/small_04_loserand_04.txt, small/small_04_loserand_05.txt, small/small_04_loserand_06.txt, small/small_04_loserand_07.txt, small/small_04_loserand_08.txt, small/small_04_loserand_09.txt, small/small_99_min_01.txt, small/small_99_min_02.txt
part2 small/small_00_sample_01.txt, small/small_00_sample_02.txt, small/small_01_rand_00.txt, small/small_01_rand_01.txt, small/small_01_rand_02.txt, small/small_01_rand_03.txt, small/small_01_rand_04.txt, small/small_01_rand_05.txt, small/small_01_rand_06.txt, small/small_01_rand_07.txt, small/small_01_rand_08.txt, small/small_01_rand_09.txt, small/small_02_maxrand_00.txt, small/small_02_maxrand_01.txt, small/small_02_maxrand_02.txt, small/small_02_maxrand_03.txt, small/small_02_maxrand_04.txt, small/small_02_maxrand_05.txt, small/small_02_maxrand_06.txt, small/small_02_maxrand_07.txt, small/small_02_maxrand_08.txt, small/small_02_maxrand_09.txt, small/small_03_max_00.txt, small/small_03_max_01.txt, small/small_04_loserand_00.txt, small/small_04_loserand_01.txt, small/small_04_loserand_02.txt, small/small_04_loserand_03.txt, small/small_04_loserand_04.txt, small/small_04_loserand_05.txt, small/small_04_loserand_06.txt, small/small_04_loserand_07.txt, small/small_04_loserand_08.txt, small/small_04_loserand_09.txt, small/small_99_min_01.txt, small/small_99_min_02.txt, large/large_00_sample_03.txt, large/large_01_rand_00.txt, large/large_01_rand_01.txt, large/large_01_rand_02.txt, large/large_01_rand_03.txt, large/large_01_rand_04.txt, large/large_01_rand_05.txt, large/large_01_rand_06.txt, large/large_01_rand_07.txt, large/large_01_rand_08.txt, large/large_01_rand_09.txt, large/large_02_maxrand_00.txt, large/large_02_maxrand_01.txt, large/large_02_maxrand_02.txt, large/large_02_maxrand_03.txt, large/large_02_maxrand_04.txt, large/large_02_maxrand_05.txt, large/large_02_maxrand_06.txt, large/large_02_maxrand_07.txt, large/large_02_maxrand_08.txt, large/large_02_maxrand_09.txt, large/large_03_max_00.txt, large/large_03_max_01.txt, large/large_04_loserand_00.txt, large/large_04_loserand_01.txt, large/large_04_loserand_02.txt, large/large_04_loserand_03.txt, large/large_04_loserand_04.txt, large/large_04_loserand_05.txt, large/large_04_loserand_06.txt, large/large_04_loserand_07.txt, large/large_04_loserand_08.txt, large/large_04_loserand_09.txt
Case Name Status Exec Time Memory
large/large_00_sample_03.txt AC 0 ms 128 KB
large/large_01_rand_00.txt AC 6 ms 128 KB
large/large_01_rand_01.txt AC 1 ms 128 KB
large/large_01_rand_02.txt AC 6 ms 128 KB
large/large_01_rand_03.txt AC 2 ms 128 KB
large/large_01_rand_04.txt AC 7 ms 128 KB
large/large_01_rand_05.txt AC 5 ms 128 KB
large/large_01_rand_06.txt AC 5 ms 128 KB
large/large_01_rand_07.txt AC 6 ms 128 KB
large/large_01_rand_08.txt AC 2 ms 128 KB
large/large_01_rand_09.txt AC 7 ms 128 KB
large/large_02_maxrand_00.txt AC 8 ms 128 KB
large/large_02_maxrand_01.txt AC 7 ms 128 KB
large/large_02_maxrand_02.txt AC 7 ms 128 KB
large/large_02_maxrand_03.txt AC 7 ms 128 KB
large/large_02_maxrand_04.txt AC 7 ms 128 KB
large/large_02_maxrand_05.txt AC 7 ms 128 KB
large/large_02_maxrand_06.txt AC 7 ms 128 KB
large/large_02_maxrand_07.txt AC 7 ms 128 KB
large/large_02_maxrand_08.txt AC 7 ms 128 KB
large/large_02_maxrand_09.txt AC 8 ms 128 KB
large/large_03_max_00.txt AC 30 ms 128 KB
large/large_03_max_01.txt AC 30 ms 128 KB
large/large_04_loserand_00.txt AC 1 ms 128 KB
large/large_04_loserand_01.txt AC 1 ms 128 KB
large/large_04_loserand_02.txt AC 1 ms 128 KB
large/large_04_loserand_03.txt AC 1 ms 128 KB
large/large_04_loserand_04.txt AC 1 ms 128 KB
large/large_04_loserand_05.txt AC 1 ms 128 KB
large/large_04_loserand_06.txt AC 2 ms 128 KB
large/large_04_loserand_07.txt AC 1 ms 128 KB
large/large_04_loserand_08.txt AC 1 ms 128 KB
large/large_04_loserand_09.txt AC 1 ms 128 KB
small/small_00_sample_01.txt AC 0 ms 128 KB
small/small_00_sample_02.txt AC 0 ms 128 KB
small/small_01_rand_00.txt AC 0 ms 128 KB
small/small_01_rand_01.txt AC 0 ms 128 KB
small/small_01_rand_02.txt AC 0 ms 128 KB
small/small_01_rand_03.txt AC 1 ms 128 KB
small/small_01_rand_04.txt AC 1 ms 128 KB
small/small_01_rand_05.txt AC 1 ms 128 KB
small/small_01_rand_06.txt AC 0 ms 128 KB
small/small_01_rand_07.txt AC 0 ms 128 KB
small/small_01_rand_08.txt AC 1 ms 128 KB
small/small_01_rand_09.txt AC 1 ms 128 KB
small/small_02_maxrand_00.txt AC 1 ms 128 KB
small/small_02_maxrand_01.txt AC 1 ms 128 KB
small/small_02_maxrand_02.txt AC 1 ms 128 KB
small/small_02_maxrand_03.txt AC 1 ms 128 KB
small/small_02_maxrand_04.txt AC 1 ms 128 KB
small/small_02_maxrand_05.txt AC 1 ms 128 KB
small/small_02_maxrand_06.txt AC 1 ms 128 KB
small/small_02_maxrand_07.txt AC 1 ms 128 KB
small/small_02_maxrand_08.txt AC 1 ms 128 KB
small/small_02_maxrand_09.txt AC 1 ms 128 KB
small/small_03_max_00.txt AC 1 ms 128 KB
small/small_03_max_01.txt AC 1 ms 128 KB
small/small_04_loserand_00.txt AC 1 ms 128 KB
small/small_04_loserand_01.txt AC 1 ms 128 KB
small/small_04_loserand_02.txt AC 1 ms 128 KB
small/small_04_loserand_03.txt AC 0 ms 128 KB
small/small_04_loserand_04.txt AC 1 ms 128 KB
small/small_04_loserand_05.txt AC 1 ms 128 KB
small/small_04_loserand_06.txt AC 1 ms 128 KB
small/small_04_loserand_07.txt AC 1 ms 128 KB
small/small_04_loserand_08.txt AC 1 ms 128 KB
small/small_04_loserand_09.txt AC 1 ms 128 KB
small/small_99_min_01.txt AC 0 ms 128 KB
small/small_99_min_02.txt AC 1 ms 128 KB