Submission #1771943


Source Code Expand

#include <set>
#include <map>
#include <queue>
#include <ctime>
#include <cmath>
#include <cstdio>
#include <bitset>
#include <vector>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
typedef double db;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int,int> pa;
typedef unsigned int uint;
typedef unsigned long long ull;
#define w1 first
#define ls (x<<1)
#define w2 second
#define ins insert
#define rs (x<<1|1) 
#define mp make_pair
#define pb push_back
#define mid ((l+r)>>1)
#define sqr(x) ((x)*(x))
#define cle(x) ((x).clear())
#define lowbit(x) ((x)&(-x))
#define SZ(x) (int((x).size()))
#define ms(x,y) memset(x,y,sizeof (x))
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define rep2(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define per(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define Rep(p,x) for(int (p)=head[(x)];(p);(p)=nxt[(p)]) 
#define Rep2(p,x) for(int (p)=cur[(x)];(p);(p)=nxt[(p)])
template<class T>inline void read(T&num){
	num=0;T f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')num=num*10+ch-'0',ch=getchar();
	num*=f;
}
inline int getgcd(int x,int y){if(!x)return y;return getgcd(y%x,x);}
inline int power(int x,int k,int p){int res=1;for(;k;k>>=1,x=(ll)x*x%p)if(k&1)res=(ll)res*x%p;return res;}
const double pi=acos(-1);	
inline void judge(){
	freopen("input.txt","r",stdin);
} 
//********************************head*************************************
const int maxn=1e2+5,maxm=1e5+5;
int n,m,ans;
bitset<maxn>S[maxn];
int x[maxm],y[maxm],ban[maxn];
int main(){
	read(n);read(m);
	rep(i,1,m)read(x[i]),read(y[i]);
	rep(i,1,n){
		S[i][i]=1;
		per(j,m,1){
			if(S[i][x[j]]&&S[i][y[j]]){
				ban[i]=1;
				break;
			}else if(S[i][x[j]])S[i][y[j]]=1;
			else if(S[i][y[j]])S[i][x[j]]=1;
		}
	}
	rep(i,1,n)rep(j,i+1,n)if(!ban[i]&&!ban[j]&&(S[i]&S[j])==0u)ans++;
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task E - Poor Turkeys
User Vegetable
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2026 Byte
Status RE
Exec Time 110 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
AC × 4
AC × 5
RE × 70
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt, 1_70.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt RE 99 ms 256 KB
1_01.txt RE 99 ms 256 KB
1_02.txt RE 100 ms 256 KB
1_03.txt RE 101 ms 256 KB
1_04.txt RE 100 ms 256 KB
1_05.txt RE 102 ms 256 KB
1_06.txt RE 100 ms 256 KB
1_07.txt RE 101 ms 384 KB
1_08.txt RE 100 ms 384 KB
1_09.txt RE 100 ms 384 KB
1_10.txt RE 101 ms 384 KB
1_11.txt RE 100 ms 384 KB
1_12.txt RE 101 ms 640 KB
1_13.txt RE 105 ms 896 KB
1_14.txt RE 106 ms 768 KB
1_15.txt RE 107 ms 768 KB
1_16.txt RE 101 ms 256 KB
1_17.txt RE 103 ms 256 KB
1_18.txt RE 98 ms 256 KB
1_19.txt RE 101 ms 256 KB
1_20.txt RE 100 ms 256 KB
1_21.txt RE 101 ms 256 KB
1_22.txt RE 101 ms 256 KB
1_23.txt RE 101 ms 256 KB
1_24.txt RE 102 ms 384 KB
1_25.txt RE 101 ms 384 KB
1_26.txt RE 100 ms 384 KB
1_27.txt RE 104 ms 384 KB
1_28.txt RE 108 ms 768 KB
1_29.txt RE 108 ms 768 KB
1_30.txt RE 108 ms 768 KB
1_31.txt RE 107 ms 640 KB
1_32.txt RE 105 ms 256 KB
1_33.txt RE 105 ms 256 KB
1_34.txt RE 103 ms 256 KB
1_35.txt RE 99 ms 256 KB
1_36.txt RE 100 ms 256 KB
1_37.txt RE 101 ms 256 KB
1_38.txt RE 100 ms 256 KB
1_39.txt RE 100 ms 256 KB
1_40.txt RE 100 ms 384 KB
1_41.txt RE 102 ms 384 KB
1_42.txt RE 102 ms 384 KB
1_43.txt RE 102 ms 384 KB
1_44.txt RE 106 ms 1024 KB
1_45.txt RE 105 ms 896 KB
1_46.txt RE 106 ms 896 KB
1_47.txt RE 105 ms 896 KB
1_48.txt RE 102 ms 256 KB
1_49.txt RE 99 ms 256 KB
1_50.txt RE 100 ms 256 KB
1_51.txt RE 100 ms 256 KB
1_52.txt RE 99 ms 256 KB
1_53.txt RE 100 ms 256 KB
1_54.txt RE 100 ms 256 KB
1_55.txt RE 100 ms 256 KB
1_56.txt RE 105 ms 256 KB
1_57.txt RE 103 ms 256 KB
1_58.txt RE 103 ms 256 KB
1_59.txt RE 103 ms 256 KB
1_60.txt RE 109 ms 896 KB
1_61.txt RE 110 ms 896 KB
1_62.txt RE 108 ms 768 KB
1_63.txt RE 109 ms 768 KB
1_64.txt RE 99 ms 256 KB
1_65.txt RE 100 ms 256 KB
1_66.txt RE 99 ms 256 KB
1_67.txt RE 100 ms 256 KB
1_68.txt RE 101 ms 256 KB
1_69.txt RE 106 ms 1024 KB
1_70.txt AC 1 ms 256 KB