Submission #472790

#TimeUsernameProblemLanguageResultExecution timeMemory
472790HossamHero7Tetris (COCI17_tetris)C++14
80 / 80
1 ms204 KiB
#include <bits/stdc++.h> #include <unordered_map> using namespace std; typedef long long ll; typedef vector <ll> row; typedef vector <row> matrix; #define endl '\n' #define fast ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define all(v) ((v).begin()), ((v).end()) #define allR(v) ((v).rbegin()), ((v).rend()) #define For(i,n) for(int i=0;i<(int)(n);i++) #define sz(v) v.size() #define swapS(a,b) if(a>b) swap(a,b) const ll mod = 1e9+7; const ll OO = 1e18; const ll invalid = -1e18; int dx[] = {0,0,-1,1,1,1,-1,-1}; int dy[] = {1,-1,0,0,1,-1,-1,1}; ll fixMod(ll x){ return ((x%mod) + mod) % mod; } ll lcm(ll a,ll b){ return max(a,b)/__gcd(a,b)*min(a,b); } ll power(ll a,ll b){ if(b==0) return 1; if(b==1) return a; if(b&1){ ll y=power(a,b/2); return (y*y*a); } else { ll y=power(a,b/2); return (y*y); } } ll inv(ll n){ return power(n,(mod-2)); } matrix zero(int n,int m){ return matrix(n,row(m,0)); } matrix identity(int n){ matrix ret = zero(n,n); for(int i=0;i<n;i++){ ret[i][i] = 1; } return ret; } matrix multiply(const matrix &a, const matrix &b){ matrix ret = zero(a.size(),b[0].size()); for(int i=0;i<a.size();i++){ for(int k=0;k<a[0].size();k++){ for(int j=0;j<b[0].size();j++){ ret[i][j] += a[i][k] * b[k][j]; ret[i][j] = ret[i][j]; } } } return ret; } matrix matrixPower(matrix &a,ll b){ if(b == 0) return identity(a.size()); if(b == 1) return a; matrix r = matrixPower(a,b/2); if(b&1) return multiply(multiply(r,r),a); return multiply(r,r); } vector <string> v; int n,m; bool valid(int i,int j){ return i<n&&i>=0&&j<m&&j>=0; } bool isFig1(int i,int j){ if(valid(i,j+1) && valid(i+1,j) && valid(i+1,j+1)){ if(v[i][j+1] == v[i][j] && v[i+1][j] == v[i][j] && v[i+1][j+1] == v[i][j]) return 1; } return 0; } bool isFig2(int i,int j){ if(valid(i,j+1) && valid(i,j+2) && valid(i,j+3)){ if(v[i][j+1] == v[i][j] && v[i][j+2] == v[i][j] && v[i][j+3] == v[i][j]) return 1; } if(valid(i+1,j) && valid(i+2,j) && valid(i+3,j)){ if(v[i+1][j] == v[i][j] && v[i+2][j] == v[i][j] && v[i+3][j] == v[i][j]) return 1; } return 0; } bool isFig3(int i,int j){ if(valid(i,j+1) && valid(i+1,j) && valid(i+1,j-1)){ if(v[i][j+1] == v[i][j] && v[i+1][j] == v[i][j] && v[i+1][j-1] == v[i][j]) return 1; } if(valid(i+1,j) && valid(i+1,j+1) && valid(i+2,j+1)){ if(v[i+1][j] == v[i][j] && v[i+1][j+1] == v[i][j] && v[i+2][j+1] == v[i][j]) return 1; } return 0; } bool isFig4(int i,int j){ if(valid(i,j+1) && valid(i+1,j+1) && valid(i+1,j+2)){ if(v[i][j+1] == v[i][j] && v[i+1][j+1] == v[i][j] && v[i+1][j+2] == v[i][j]) return 1; } if(valid(i+1,j) && valid(i+1,j-1) && valid(i+2,j-1)){ if(v[i+1][j] == v[i][j] && v[i+1][j-1] == v[i][j] && v[i+2][j-1] == v[i][j]) return 1; } return 0; } bool isFig5(int i,int j){ if(valid(i+1,j) && valid(i+1,j+1) && valid(i+1,j-1)){ if(v[i+1][j] == v[i][j] && v[i+1][j+1] == v[i][j] && v[i+1][j-1] == v[i][j]) return 1; } if(valid(i+1,j) && valid(i+1,j-1) && valid(i+2,j)){ if(v[i+1][j] == v[i][j] && v[i+1][j-1] == v[i][j] && v[i+2][j] == v[i][j]) return 1; } if(valid(i,j+1) && valid(i,j+2) && valid(i+1,j+1)){ if(v[i][j+1] == v[i][j] && v[i][j+2] == v[i][j] && v[i+1][j+1] == v[i][j]) return 1; } if(valid(i+1,j) && valid(i+1,j+1) && valid(i+2,j)){ if(v[i+1][j] == v[i][j] && v[i+1][j+1] == v[i][j] && v[i+2][j] == v[i][j]) return 1; } return 0; } void solve(){ cin>>n>>m; vector <int> ans(5); v.resize(n); for(auto &i:v) cin>>i; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ if(v[i][j] != '.'){ if(isFig1(i,j)) ans[0] ++; if(isFig2(i,j)) ans[1] ++; if(isFig3(i,j)) ans[2] ++; if(isFig4(i,j)) ans[3] ++; if(isFig5(i,j)) ans[4] ++; } } } for(auto i : ans) cout<<i<<endl; } int main() { fast ll t=1; // cin>>t; while(t--){ //Some important Notes: // 1- Any minus with mod fixed mod // 2- Any divide with mod inverse // 3- Any mod problem make mod in every where // 4- Any dp problem don't forget to return the saved value :) solve(); } return 0; }

Compilation message (stderr)

tetris.cpp: In function 'matrix multiply(const matrix&, const matrix&)':
tetris.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(int i=0;i<a.size();i++){
      |                 ~^~~~~~~~~
tetris.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |         for(int k=0;k<a[0].size();k++){
      |                     ~^~~~~~~~~~~~
tetris.cpp:54:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |             for(int j=0;j<b[0].size();j++){
      |                         ~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...