Submission #169346
Source Code Expand
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <assert.h>
#include <sys/time.h>
#include <fstream>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define REP(i,n) FOR(i,0,n)
#define each(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define deb(x) cerr << #x << " = " << (x) << " , ";
#define debl cerr << " (L" << __LINE__ << ")"<< endl;
#define sz(s) (int)((s).size())
#define clr(a) memset((a),0,sizeof(a))
#define nclr(a) memset((a),-1,sizeof(a))
#define pb push_back
#define INRANGE(x,s,e) ((s)<=(x) && (x)<(e))
#define MP(x,y) make_pair((x),(y))
double pi=3.14159265358979323846;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
template<typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& z){
os << "[ ";
REP(i,z.size())os << z[i] << ", " ;
return ( os << "]" << endl);
}
template<typename T> std::ostream& operator<<(std::ostream& os, const set<T>& z){
os << "set( ";
EACH(p,z)os << (*p) << ", " ;
return ( os << ")" << endl);
}
template<typename T,typename U> std::ostream& operator<<(std::ostream& os, const map<T,U>& z){
os << "{ ";
EACH(p,z)os << (p->first) << ": " << (p->second) << ", " ;
return ( os << "}" << endl);
}
template<typename T,typename U> std::ostream& operator<<(std::ostream& os, const pair<T,U>& z){
return ( os << "(" << z.first << ", " << z.second << ",)" );
}
double get_time(){
struct timeval tv;
gettimeofday(&tv, NULL);
return tv.tv_sec + tv.tv_usec*1e-6;
}
typedef unsigned int uint32_t;
struct RND{
uint32_t x;
uint32_t y;
uint32_t z;
uint32_t w;
RND(){
x=123456789;
y=362436069;
z=521288629;
w=88675123;
}
void init(int seed){
x=123456789;
y=362436069;
z=521288629;
w=seed+100;
REP(i,10)get();
}
uint32_t get(){
uint32_t t;
t=x^(x<<11);
x=y;y=z;z=w;
w=(w^(w>>19))^(t^(t>>8));
return w;
}
};
RND rnd;
ll N;
ll xs[100],ys[100];
typedef tuple<ll,ll,ll,ll,ll> T;
map<T, ll> memo;
ll rec(ll bit, ll lx, ll hx, ll ly, ll hy){
ll nbit = 0;
rep(i,N) if((bit>>i)%2==1){
ll x = xs[i], y = ys[i];
if(lx<x && x<hx && ly<y && y<hy)nbit += (1LL<<i);
}
bit = nbit;
if(bit==0)return 0;
T key(bit, lx, ly, hx, hy);
if(exist(memo, key)) return memo[key];
ll ans=0;
rep(i,N) if((bit>>i)%2==1){
ll x = xs[i], y = ys[i];
ll res = (hx-lx-1)+(hy-ly-1)-1;
res += rec(bit-(1LL<<i), x, hx, y, hy);
res += rec(bit-(1LL<<i), x, hx, ly, y);
res += rec(bit-(1LL<<i), lx, x, y, hy);
res += rec(bit-(1LL<<i), lx, x, ly, y);
ans = max(ans, res);
}
return memo[key] = ans;
}
void _main(istream &inp){
ll W,H;
inp >> W >> H;
inp >> N;
rep(i,N) inp >> xs[i] >> ys[i];
cout << rec((1LL<<N)-1, 0, W+1, 0, H+1) << endl;
}
int main(){
if(0){
ifstream ifs("test.txt");
_main(ifs);
}
else{
_main(cin);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
D - 金塊ゲーム |
User |
hirosegolf |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
3698 Byte |
Status |
AC |
Exec Time |
56 ms |
Memory |
1328 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Subtask3 |
Score / Max Score |
0 / 0 |
80 / 80 |
19 / 19 |
1 / 1 |
Status |
|
|
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 |
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 |
Subtask2 |
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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt |
Subtask3 |
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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask3_04.txt, subtask3_05.txt, subtask3_06.txt, subtask3_07.txt, subtask3_08.txt, subtask3_09.txt, subtask3_10.txt, subtask3_11.txt, subtask3_12.txt, subtask3_13.txt, subtask3_14.txt, subtask3_15.txt, subtask3_16.txt, subtask3_17.txt, subtask3_18.txt, subtask3_19.txt, subtask3_20.txt, subtask3_21.txt, subtask3_22.txt, subtask3_23.txt, subtask3_24.txt, subtask3_25.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
21 ms |
808 KB |
sample_02.txt |
AC |
21 ms |
796 KB |
sample_03.txt |
AC |
21 ms |
904 KB |
subtask1_01.txt |
AC |
19 ms |
916 KB |
subtask1_02.txt |
AC |
20 ms |
792 KB |
subtask1_03.txt |
AC |
21 ms |
924 KB |
subtask1_04.txt |
AC |
22 ms |
924 KB |
subtask1_05.txt |
AC |
21 ms |
800 KB |
subtask1_06.txt |
AC |
21 ms |
920 KB |
subtask1_07.txt |
AC |
20 ms |
916 KB |
subtask1_08.txt |
AC |
22 ms |
796 KB |
subtask1_09.txt |
AC |
21 ms |
716 KB |
subtask1_10.txt |
AC |
22 ms |
796 KB |
subtask1_11.txt |
AC |
22 ms |
716 KB |
subtask1_12.txt |
AC |
21 ms |
796 KB |
subtask1_13.txt |
AC |
21 ms |
924 KB |
subtask1_14.txt |
AC |
21 ms |
868 KB |
subtask1_15.txt |
AC |
22 ms |
920 KB |
subtask1_16.txt |
AC |
21 ms |
924 KB |
subtask1_17.txt |
AC |
21 ms |
812 KB |
subtask1_18.txt |
AC |
22 ms |
920 KB |
subtask1_19.txt |
AC |
21 ms |
920 KB |
subtask1_20.txt |
AC |
20 ms |
920 KB |
subtask1_21.txt |
AC |
19 ms |
920 KB |
subtask1_22.txt |
AC |
21 ms |
920 KB |
subtask1_23.txt |
AC |
21 ms |
912 KB |
subtask1_24.txt |
AC |
20 ms |
916 KB |
subtask1_25.txt |
AC |
19 ms |
916 KB |
subtask2_01.txt |
AC |
23 ms |
792 KB |
subtask2_02.txt |
AC |
22 ms |
920 KB |
subtask2_03.txt |
AC |
25 ms |
944 KB |
subtask2_04.txt |
AC |
25 ms |
972 KB |
subtask2_05.txt |
AC |
31 ms |
928 KB |
subtask2_06.txt |
AC |
34 ms |
1064 KB |
subtask2_07.txt |
AC |
35 ms |
1052 KB |
subtask2_08.txt |
AC |
36 ms |
1052 KB |
subtask2_09.txt |
AC |
50 ms |
1324 KB |
subtask2_10.txt |
AC |
47 ms |
1316 KB |
subtask2_11.txt |
AC |
49 ms |
1320 KB |
subtask2_12.txt |
AC |
54 ms |
1320 KB |
subtask2_13.txt |
AC |
34 ms |
1060 KB |
subtask2_14.txt |
AC |
35 ms |
1064 KB |
subtask2_15.txt |
AC |
22 ms |
920 KB |
subtask2_16.txt |
AC |
33 ms |
1168 KB |
subtask2_17.txt |
AC |
52 ms |
1324 KB |
subtask2_18.txt |
AC |
52 ms |
1316 KB |
subtask2_19.txt |
AC |
49 ms |
1324 KB |
subtask2_20.txt |
AC |
48 ms |
1324 KB |
subtask2_21.txt |
AC |
51 ms |
1324 KB |
subtask2_22.txt |
AC |
48 ms |
1316 KB |
subtask2_23.txt |
AC |
47 ms |
1308 KB |
subtask2_24.txt |
AC |
52 ms |
1304 KB |
subtask2_25.txt |
AC |
54 ms |
1304 KB |
subtask3_01.txt |
AC |
19 ms |
920 KB |
subtask3_02.txt |
AC |
20 ms |
920 KB |
subtask3_03.txt |
AC |
20 ms |
916 KB |
subtask3_04.txt |
AC |
22 ms |
920 KB |
subtask3_05.txt |
AC |
26 ms |
1048 KB |
subtask3_06.txt |
AC |
24 ms |
1048 KB |
subtask3_07.txt |
AC |
25 ms |
928 KB |
subtask3_08.txt |
AC |
33 ms |
1064 KB |
subtask3_09.txt |
AC |
37 ms |
1056 KB |
subtask3_10.txt |
AC |
50 ms |
1312 KB |
subtask3_11.txt |
AC |
47 ms |
1320 KB |
subtask3_12.txt |
AC |
52 ms |
1324 KB |
subtask3_13.txt |
AC |
52 ms |
1320 KB |
subtask3_14.txt |
AC |
49 ms |
1320 KB |
subtask3_15.txt |
AC |
48 ms |
1316 KB |
subtask3_16.txt |
AC |
47 ms |
1328 KB |
subtask3_17.txt |
AC |
56 ms |
1316 KB |
subtask3_18.txt |
AC |
29 ms |
936 KB |
subtask3_19.txt |
AC |
49 ms |
1320 KB |
subtask3_20.txt |
AC |
35 ms |
1180 KB |
subtask3_21.txt |
AC |
53 ms |
1324 KB |
subtask3_22.txt |
AC |
50 ms |
1320 KB |
subtask3_23.txt |
AC |
50 ms |
1312 KB |
subtask3_24.txt |
AC |
48 ms |
1316 KB |
subtask3_25.txt |
AC |
45 ms |
1312 KB |