| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 250256 |
2020-07-17T10:17:41 Z |
leaked |
Tetris (COCI17_tetris) |
C++14 |
|
1000 ms |
63352 KB |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
////
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("-O3")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
////#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=10+1;
const int M=1e9+7;
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> st;
signed main()
{
fast_io;
int n,m;
cin>>n>>m;
vector<vector<char>>a(n,vector<char>(m));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
}
}
vector<vector<pii>>lol(11,vector<pii>(4,m_p(0,0)));
lol[0]={{0,0},{0,1},{1,0},{1,1}};
///
lol[1]={{0,0},{0,1},{0,2},{0,3}};
lol[2]={{0,0},{1,0},{2,0},{3,0}};
///
lol[3]={{0,0},{0,1},{-1,1},{-1,2}};
lol[4]={{0,0},{1,0},{1,1},{1,2}};
///
lol[5]={{0,0},{0,1},{1,1},{1,2}};
lol[6]={{0,0},{-1,0},{-1,1},{-2,1}};
///
lol[7]={{0,0},{0,1},{1,1},{0,2}};
lol[8]={{0,0},{0,1},{-1,1},{0,2}};
lol[9]={{0,0},{1,0},{1,1},{2,0}};
lol[10]={{0,0},{1,0},{-1,1},{2,0}};
queue<pair<vector<vector<char>>,vector<int>>>q;
vector<int>dd(5,0);
map<vector<vector<char>>,bool>bl;
q.push({a,dd});vector<vector<char>> c;vector<int>ps;
while(!q.empty()){
c=q.front().f;ps=q.front().s;
q.pop();
int d=0;
//debug()<<imie(c)<<imie(ps);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
for(int k=0;k<11;k++){
char need=c[i][j];
if(need=='.') continue;
d++;
int ss=0;
for(int t=0;t<4;t++){
auto nx=i+lol[k][t].f,ny=j+lol[k][t].s;
if(nx<n && nx>=0 && ny<m && ny>=0 && c[nx][ny]==need){
ss++;
}
}
if(ss==4){
if(k==0){
ps[0]++;
}
else if(k>0 && k<7){
ps[(k+1)/2]++;
}
else{
ps[4]++;
}
for(int t=0;t<4;t++){
auto nx=i+lol[k][t].f,ny=j+lol[k][t].s;
c[nx][ny]='.';
}
if(!bl[c]){
q.push({c,ps}); bl[c]=1;
}
if(k==0){
ps[0]--;
}
else if(k>0 && k<7){
ps[(k+1)/2]--;
}
else{
ps[4]--;
}
for(int t=0;t<4;t++){
auto nx=i+lol[k][t].f,ny=j+lol[k][t].s;
c[nx][ny]=need;
}
}
}
}
}
if(!d){
for(auto &z : ps) cout<<z<<endl;
exit(0);
}
}
return 0;
}
/*
*
**
*
2 0 2 0 1
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Incorrect |
11 ms |
896 KB |
Output isn't correct |
| 6 |
Incorrect |
7 ms |
640 KB |
Output isn't correct |
| 7 |
Incorrect |
27 ms |
1528 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
| 9 |
Incorrect |
130 ms |
4472 KB |
Output isn't correct |
| 10 |
Execution timed out |
1090 ms |
63352 KB |
Time limit exceeded |
