Submission #250238

#TimeUsernameProblemLanguageResultExecution timeMemory
250238leakedTetris (COCI17_tetris)C++14
Compilation error
0 ms0 KiB
#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; char a[N][N]; bool try1(int i,int j,vector<vector<char>>& c){ char w=c[i][j]; if(i+1<sz(c) && j+1<sz(c)){ if(c[i][j]==c[i+1][j] && c[i][j]==c[i][j+1] && c[i][j]==c[i+1][j+1]){ return 1; c[i][j]='.'; c[i][j+1]='.'; c[i+1][j]='.'; c[i+1][j+1]='.'; ps[0]++; } } } bool try2(int i,int j,vector<vector<char>>& c){ char w=c[i][j]; if(i<sz(c) && j+3<sz(c)){ if(c[i][j]==c[i][j+1] && c[i][j]==c[i][j+2] && c[i][j]==c[i][j+3] ){ return 1; } } } bool try3(int i,int j,vector<vector<char>>& c){ char w=c[i][j]; if(i+3<sz(c) && j<sz(c)){ if(c[i][j]==c[i+3][j] && c[i][j]==c[i+2][j] && c[i+1][j]==c[i][j] ){ return 1; } } } bool try4(int i,int j,vector<vector<char>>& c){ char w=c[i][j]; if(i>=1 && j+2<sz(c)){ if(c[i][j]==c[i+3][j] && c[i][j]==c[i+2][j] && c[i+1][j]==c[i][j] ){ return 1; } } } bool try4(int i,int j,vector<vector<char>>& c){ char w=c[i][j]; if(i+3<sz(c) && j<sz(c)){ if(c[i][j]==c[i+3][j] && c[i][j]==c[i+2][j] && c[i+1][j]==c[i][j] ){ return 1; } } } bool try4(int i,int j,vector<vector<char>>& c){ char w=c[i][j]; if(i+3<sz(c) && j<sz(c)){ if(c[i][j]==c[i+3][j] && c[i][j]==c[i+2][j] && c[i+1][j]==c[i][j] ){ return 1; } } } bool try4(int i,int j,vector<vector<char>>& c){ char w=c[i][j]; if(i+3<sz(c) && j<sz(c)){ if(c[i][j]==c[i+3][j] && c[i][j]==c[i+2][j] && c[i+1][j]==c[i][j] ){ return 1; } } } signed main() { fast_io; /// мне лень return 0; } /* * *** * ** * *** * 2 0 2 0 1 */

Compilation message (stderr)

tetris.cpp: In function 'bool try1(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:95:13: error: 'ps' was not declared in this scope
             ps[0]++;
             ^~
tetris.cpp:95:13: note: suggested alternative: 'pi'
             ps[0]++;
             ^~
             pi
tetris.cpp:87:10: warning: unused variable 'w' [-Wunused-variable]
     char w=c[i][j];
          ^
tetris.cpp: In function 'bool try2(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:100:10: warning: unused variable 'w' [-Wunused-variable]
     char w=c[i][j];
          ^
tetris.cpp: In function 'bool try3(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:108:10: warning: unused variable 'w' [-Wunused-variable]
     char w=c[i][j];
          ^
tetris.cpp: In function 'bool try4(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:116:10: warning: unused variable 'w' [-Wunused-variable]
     char w=c[i][j];
          ^
tetris.cpp: In function 'bool try4(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:123:6: error: redefinition of 'bool try4(int, int, std::vector<std::vector<char> >&)'
 bool try4(int i,int j,vector<vector<char>>& c){
      ^~~~
tetris.cpp:115:6: note: 'bool try4(int, int, std::vector<std::vector<char> >&)' previously defined here
 bool try4(int i,int j,vector<vector<char>>& c){
      ^~~~
tetris.cpp:124:10: warning: unused variable 'w' [-Wunused-variable]
     char w=c[i][j];
          ^
tetris.cpp: In function 'bool try4(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:131:6: error: redefinition of 'bool try4(int, int, std::vector<std::vector<char> >&)'
 bool try4(int i,int j,vector<vector<char>>& c){
      ^~~~
tetris.cpp:115:6: note: 'bool try4(int, int, std::vector<std::vector<char> >&)' previously defined here
 bool try4(int i,int j,vector<vector<char>>& c){
      ^~~~
tetris.cpp:132:10: warning: unused variable 'w' [-Wunused-variable]
     char w=c[i][j];
          ^
tetris.cpp: In function 'bool try4(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:139:6: error: redefinition of 'bool try4(int, int, std::vector<std::vector<char> >&)'
 bool try4(int i,int j,vector<vector<char>>& c){
      ^~~~
tetris.cpp:115:6: note: 'bool try4(int, int, std::vector<std::vector<char> >&)' previously defined here
 bool try4(int i,int j,vector<vector<char>>& c){
      ^~~~
tetris.cpp:140:10: warning: unused variable 'w' [-Wunused-variable]
     char w=c[i][j];
          ^
tetris.cpp: In function 'bool try1(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:98:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
tetris.cpp: In function 'bool try2(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:106:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
tetris.cpp: In function 'bool try3(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:114:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
tetris.cpp: In function 'bool try4(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:122:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
tetris.cpp: In function 'bool try4(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:130:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
tetris.cpp: In function 'bool try4(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:138:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
tetris.cpp: In function 'bool try4(int, int, std::vector<std::vector<char> >&)':
tetris.cpp:146:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^