Submission #2200729


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;

int p[200][200];

int par[40000];
int find(int x){
	if(par[x]==x)return x;
	return par[x]=find(par[x]);
}
void unite(int x,int y){
	x=find(x);y=find(y);
	par[x]=y;
}
int dx[]{1,-1,0,0},dy[]{0,0,1,-1};
struct st{int a,b,c;};

int main(){
	int h,w;cin>>h>>w;
	rep(i,4)scanf("%*d");
	int cnt=0;
	rep(i,h)rep(j,w)scanf("%d",&p[i][j]),cnt+=p[i][j];
	vector<st>v;
	rep(i,h)rep(j,w){
		rep(k,4){
			int nx=i+dx[k],ny=j+dy[k];
			if(0<=nx&&nx<h&&0<=ny&&ny<w){
				v.push_back({i*w+j,nx*w+ny,p[i][j]*p[nx][ny]});
			}
		}
	}
	sort(v.begin(),v.end(),[](st a,st b){return a.c>b.c;});
	rep(i,h*w)par[i]=i;
	for(auto&s:v){
		if(find(s.a)==find(s.b))continue;
		cnt+=s.c;unite(s.a,s.b);
	}
	cout<<cnt<<endl;
}

Submission Info

Submission Time
Task D - Game on a Grid
User autumn_eel
Language C++14 (GCC 5.4.1)
Score 100
Code Size 820 Byte
Status AC
Exec Time 6 ms
Memory 1276 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i,4)scanf("%*d");
                      ^
./Main.cpp:23:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i,h)rep(j,w)scanf("%d",&p[i][j]),cnt+=p[i][j];
                                                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 32
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 6 ms 1276 KB
subtask1_08.txt AC 6 ms 1276 KB
subtask1_09.txt AC 6 ms 1276 KB
subtask1_10.txt AC 6 ms 1276 KB
subtask1_11.txt AC 6 ms 1276 KB
subtask1_12.txt AC 6 ms 1276 KB
subtask1_13.txt AC 6 ms 1276 KB
subtask1_14.txt AC 6 ms 1276 KB
subtask1_15.txt AC 6 ms 1276 KB
subtask1_16.txt AC 4 ms 1276 KB
subtask1_17.txt AC 1 ms 384 KB
subtask1_18.txt AC 1 ms 256 KB
subtask1_19.txt AC 1 ms 384 KB
subtask1_20.txt AC 4 ms 1276 KB
subtask1_21.txt AC 5 ms 1276 KB
subtask1_22.txt AC 5 ms 1276 KB
subtask1_23.txt AC 5 ms 1276 KB
subtask1_24.txt AC 1 ms 256 KB
subtask1_25.txt AC 1 ms 256 KB
subtask1_26.txt AC 1 ms 256 KB
subtask1_27.txt AC 1 ms 256 KB
subtask1_28.txt AC 1 ms 256 KB
subtask1_29.txt AC 1 ms 256 KB