Submission #1163634


Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;

typedef pair<int,int> P;
typedef pair<P,int> PP;
 
int R,C,N,n;

PP G[100005]; 

int c[100005],r[100005],A[100005],X[100005],Y[100005];

const int INF=1000000005;
 
int main(){             
  
  cin>>R>>C>>N; 
  
  for(int i=0; i<N; i++) scanf("%d %d %d", &G[i].first.first, &G[i].first.second, &G[i].second);

  sort(G,G+N);

  for(int i=0; i<N; i++){
  	X[i]=G[i].first.first;
  	Y[i]=G[i].first.second;
  	A[i]=G[i].second;
  }

  for(int i=0; i<100005; i++){
  	c[i]=INF; r[i]=INF;
  }

  c[Y[0]]=0;

  for(int i=0; i<N; i++){
  	if(Y[i]==Y[0]){
  		r[X[i]]=A[i]; 
  	}
  }

while(1){
  for(int i=0; i<N; i++){
  	if(r[X[i]]==INF&&c[Y[i]]!=INF){
  		r[X[i]]=A[i]-c[Y[i]]; 
  	}
  	if(r[X[i]]!=INF&&c[Y[i]]==INF){
  		c[Y[i]]=A[i]-r[X[i]]; 
  	}
  	if(r[X[i]]!=INF&&c[Y[i]]!=INF) n++;
  }
  if(n==N) break;
} 

  for(int i=0; i<N; i++){
  	if(r[X[i]]!=INF&&c[Y[i]]!=INF){
  		if(r[X[i]]+c[Y[i]]!=A[i]){
  			cout<<"No"<<endl; return 0;
  		}
  	}
  }

  int x=INF,y=INF; int p,q;

  for(int i=1; i<=R; i++){
  	if(r[i]<x){
  		x=r[i]; p=i;
  	}
  }

  for(int i=1; i<=C; i++){
  	if(c[i]<y){
  		y=c[i]; q=i;
  	}
  }

  if(r[p]+c[q]<0){
  	cout<<"No"<<endl; return 0;
  }

  cout<<"Yes"<<endl;
  
  return 0;
 
}    

Submission Info

Submission Time
Task D - Grid and Integers
User momotaro1303
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1353 Byte
Status TLE
Exec Time 2103 ms
Memory 3456 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:96: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   for(int i=0; i<N; i++) scanf("%d %d %d", &G[i].first.first, &G[i].first.second, &G[i].second);
                                                                                                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 5
AC × 25
TLE × 44
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.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
Case Name Status Exec Time Memory
0_00.txt AC 2 ms 1024 KB
0_01.txt AC 2 ms 1024 KB
0_02.txt AC 2 ms 1024 KB
0_03.txt AC 2 ms 1024 KB
0_04.txt AC 2 ms 1024 KB
1_00.txt AC 2 ms 1024 KB
1_01.txt AC 2 ms 1024 KB
1_02.txt AC 2 ms 1024 KB
1_03.txt AC 2 ms 1024 KB
1_04.txt AC 2 ms 1024 KB
1_05.txt AC 2 ms 1024 KB
1_06.txt TLE 2103 ms 3328 KB
1_07.txt TLE 2103 ms 3328 KB
1_08.txt TLE 2103 ms 3328 KB
1_09.txt TLE 2103 ms 3328 KB
1_10.txt TLE 2103 ms 3328 KB
1_11.txt TLE 2103 ms 3328 KB
1_12.txt TLE 2103 ms 3456 KB
1_13.txt TLE 2103 ms 3328 KB
1_14.txt TLE 2103 ms 3328 KB
1_15.txt TLE 2103 ms 3328 KB
1_16.txt TLE 2103 ms 3328 KB
1_17.txt TLE 2103 ms 3328 KB
1_18.txt TLE 2103 ms 3328 KB
1_19.txt TLE 2103 ms 3328 KB
1_20.txt TLE 2103 ms 2560 KB
1_21.txt AC 1312 ms 1664 KB
1_22.txt TLE 2103 ms 1152 KB
1_23.txt TLE 2103 ms 2432 KB
1_24.txt TLE 2103 ms 2816 KB
1_25.txt TLE 2103 ms 2432 KB
1_26.txt AC 38 ms 1152 KB
1_27.txt AC 224 ms 1280 KB
1_28.txt TLE 2103 ms 3328 KB
1_29.txt AC 1723 ms 1792 KB
1_30.txt TLE 2103 ms 3200 KB
1_31.txt TLE 2103 ms 1920 KB
1_32.txt TLE 2103 ms 2944 KB
1_33.txt TLE 2103 ms 3200 KB
1_34.txt TLE 2103 ms 1280 KB
1_35.txt TLE 2103 ms 3328 KB
1_36.txt TLE 2103 ms 1408 KB
1_37.txt TLE 2103 ms 1920 KB
1_38.txt TLE 2103 ms 2688 KB
1_39.txt AC 857 ms 1536 KB
1_40.txt TLE 2103 ms 2688 KB
1_41.txt TLE 2103 ms 1792 KB
1_42.txt TLE 2103 ms 3072 KB
1_43.txt TLE 2103 ms 2560 KB
1_44.txt TLE 2103 ms 3072 KB
1_45.txt TLE 2103 ms 1664 KB
1_46.txt TLE 2103 ms 3200 KB
1_47.txt TLE 2103 ms 1792 KB
1_48.txt TLE 2103 ms 1664 KB
1_49.txt AC 153 ms 1280 KB
1_50.txt TLE 2103 ms 2304 KB
1_51.txt TLE 2103 ms 3200 KB
1_52.txt AC 89 ms 1152 KB
1_53.txt AC 397 ms 1408 KB
1_54.txt AC 1177 ms 1664 KB
1_55.txt TLE 2103 ms 2048 KB
1_56.txt TLE 2103 ms 2560 KB
1_57.txt TLE 2103 ms 3456 KB
1_58.txt TLE 2103 ms 2944 KB
1_59.txt AC 47 ms 1152 KB
1_60.txt AC 2 ms 1024 KB
1_61.txt AC 2 ms 1024 KB
1_62.txt AC 2 ms 1024 KB
1_63.txt AC 2 ms 1024 KB