# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211205 | 2020-03-19T12:25:21 Z | tleontest1 | Bob (COCI14_bob) | C++14 | 204 ms | 26116 KB |
#pragma GCC optimize ("O3") #pragma GCC target ("sse4") #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define int long long #define mp make_pair #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo MAX = -1000000000000000000; const lo MIN = 1000000000000000000; const lo inf = 1000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 1002; const lo mod = 1000000007; int n,m,b[li],a[li][li],k,flag,t,dp[li][li]; int cev; string s; vector<int> v; main(void){ scanf("%lld %lld",&n,&m); FOR{ for(int j=1;j<=m;j++){ scanf("%lld",&a[i][j]); } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(a[i-1][j-1]!=a[i][j] && a[i][j-1]!=a[i][j] && a[i-1][j]!=a[i][j]){dp[i][j]=1;continue;} if(a[i-1][j-1]==a[i][j] && a[i][j-1]!=a[i][j] && a[i-1][j]!=a[i][j]){dp[i][j]=1;continue;} if(a[i-1][j-1]!=a[i][j] && a[i][j-1]!=a[i][j] && a[i-1][j]==a[i][j]){dp[i][j]=dp[i-1][j]+1;continue;} if(a[i-1][j-1]!=a[i][j] && a[i][j-1]==a[i][j] && a[i-1][j]!=a[i][j]){dp[i][j]=dp[i][j-1]+1;continue;} if(a[i-1][j-1]==a[i][j] && a[i][j-1]==a[i][j] && a[i-1][j]!=a[i][j]){dp[i][j]=dp[i][j-1]/dp[i-1][j-1];continue;} if(a[i-1][j-1]==a[i][j] && a[i][j-1]!=a[i][j] && a[i-1][j]==a[i][j]){dp[i][j]=dp[i-1][j]/dp[i-1][j-1];continue;} if(a[i-1][j-1]==a[i][j] && a[i][j-1]==a[i][j] && a[i-1][j]==a[i][j]){dp[i][j]=dp[i-1][j]*dp[i][j-1]/dp[i-1][j-1];continue;} if(a[i-1][j-1]!=a[i][j] && a[i][j-1]==a[i][j] && a[i-1][j]==a[i][j]){dp[i][j]=dp[i-1][j]*dp[i][j-1]*2;continue;} } } FOR{ for(int j=1;j<=m;j++){ cev+=dp[i][j]; //~ cout<<dp[i][j]<<" "; } //~ cout<<"\n"; } printf("%lld\n",cev); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 1152 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 768 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 39 ms | 9080 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 40 ms | 9592 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 45 ms | 9592 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 46 ms | 9556 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 163 ms | 23404 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 198 ms | 26116 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 196 ms | 26104 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 204 ms | 26036 KB | Execution killed with signal 8 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |