# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67059 | 2018-08-13T09:28:44 Z | MrTEK | Maxcomp (info1cup18_maxcomp) | C++14 | 2 ms | 468 KB |
#include <bits/stdc++.h> using namespace std; #define mp make_pair #define pb push_back #define len(a) (int)a.size() #define fi first #define sc second #define d1(w) cerr<<#w<<":"<<w<<endl; #define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl; #define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl; #define left ind+ind #define right ind+ind+1 #define mid (l+r)/2 #define FAST_IO ios_base::sync_with_stdio(false); #define endl '\n' const int maxn = 620; const long long LINF = 1e18; const int LOG = 31; const int INF = 1e9; const int N = 1e3 + 5; const int M = 4; const int SQ = 350; const int MOD = 998244353; typedef pair <int,int> pii; struct node { int val; short int x,y; }; bool operator < (node a ,node b) { return a.val < b.val; } priority_queue <node> Q; int mat[N][N],vis[N][N],ans = -INF; short int n,m,way[4][2] = {{1,0},{0,1},{0,-1},{-1,0}}; int main() { scanf("%d %d",&n,&m); for (short int i = 1 ; i <= n ; i++) for (short int j = 1 ; j <= m ; j++) { scanf("%d",&mat[i][j]); vis[i][j] = -INF; Q.push({mat[i][j],i,j}); } while(len(Q)) { auto temp = Q.top(); Q.pop(); int val = temp.val; short int x = temp.x,y = temp.y; if (vis[x][y] > val) continue; ans = max(ans,val - mat[x][y] - 1); for (short int i = 0 ; i < 4 ; i++) { short int nx = x + way[i][0] , ny = y + way[i][1]; if (nx > 0 && nx <= n && ny > 0 && ny <= m && val - 1 > vis[nx][ny]) { vis[nx][ny] = val - 1; Q.push({val - 1,nx,ny}); } } } printf("%d\n",ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 468 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |