Submission #2207776


Source Code Expand

#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
#define ll __int64
//#define __int64 long long
int w,h;
int n;
int x[200000],y[200000];
bool t[100][100];
P z[100];//距離、番号
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int main(){
	cin>>w>>h;
	cin>>n;
	rep(i,n){cin>>x[i]>>y[i];x[i]--;y[i]--;}
	
	rep(i,n){
		int ret=0;

			ret=min(abs(w-1-x[i]),x[i])+min(abs(h-1-y[i]),y[i]);
			//cout<<min(abs(w-1-x[i]),x[i])<<" "<<min(abs(h-1-y[i]),y[i])<<endl;
		z[i]=mp(ret,i);
	}
	sort(z,z+n);
	
	rep(i,n){
		int nx,ny,num;
		num=z[i].second;	
		ny=y[num],nx=x[num];
		if(!t[ny][nx]){
			t[ny][nx]=1;
		}
		rep(j,4){
			nx=x[z[i].second]+dx[j],ny=y[z[i].second]+dy[j];
			while(!t[ny][nx]&&nx>=0&&ny>=0&&nx<w&&ny<h){
				t[ny][nx]=1;
				nx+=dx[j];
				ny+=dy[j];
			}
		}
	}

	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - 金塊ゲーム
User pappagukun
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1127 Byte
Status CE

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:58:8: error: ‘ans’ was not declared in this scope
  cout<<ans<<endl;
        ^