Submission #289068

#TimeUsernameProblemLanguageResultExecution timeMemory
289068egekabasWombats (IOI13_wombats)C++14
55 / 100
20077 ms19020 KiB
#include "wombats.h" #include <bits/stdc++.h> #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define all(x) (x).begin(), (x).end() #define ff first #define ss second #define pb push_back #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll, ll> pll; typedef pair<ull, ull> pull; typedef pair<int, int> pii; typedef pair<ld, ld> pld; int r, c; const int sq = 300; int h[5000][200]; int v[5000][200]; int dis[5000/sq+5][200][200]; void dijkstra(int beg, int end, int imp, int dis[200]){ for(int j = 0; j < c; ++j) dis[j] = 1e9+7; dis[imp] = 0; for(int i = end; i >= beg; --i){ for(int j = 1; j < c; ++j) dis[j] = min(dis[j], dis[j-1]+h[i][j-1]); for(int j = c-2; j >= 0; --j) dis[j] = min(dis[j], dis[j+1]+h[i][j]); for(int j = 0; j < c && i != beg; ++j) dis[j] = min((int)1e9+7, dis[j] + v[i-1][j]); } } void init(int R, int C, int H[5000][200], int V[5000][200]) { r = R; c = C; for(int i = 0; i < r; ++i) for(int j = 0; j < c; ++j){ h[i][j] = H[i][j]; v[i][j] = V[i][j]; } for(int i = 0; i < r; i += sq) for(int j = 0; j < c; ++j) dijkstra(i, min(i+sq, r-1), j, dis[i/sq][j]); } void changeH(int P, int Q, int W) { h[P][Q] = W; int gr = P/sq; for(int j = 0; j < c; ++j) dijkstra(gr*sq, min(r-1, (gr+1)*sq), j, dis[gr][j]); if(gr > 0 && P%sq == 0){ --gr; for(int j = 0; j < c; ++j) dijkstra(gr*sq, min(r-1, (gr+1)*sq), j, dis[gr][j]); } } void changeV(int P, int Q, int W) { v[P][Q] = W; int gr = P/sq; for(int j = 0; j < c; ++j) dijkstra(gr*sq, min(r-1, (gr+1)*sq), j, dis[gr][j]); } int curd[200]; int newd[200]; int escape(int V1, int V2) { for(int j = 0; j < c; ++j) curd[j] = newd[j] = 1e9+7; curd[V1] = 0; for(int i = 0; i < r; i += sq){ for(int j = 0; j < c; ++j) for(int k = 0; k < c; ++k) newd[k] = min(newd[k], curd[j]+dis[i/sq][k][j]); for(int j = 0; j < c; ++j){ curd[j] = newd[j]; newd[j] = 1e9+7; } } return curd[V2]; }

Compilation message (stderr)

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
   15 |  int res;
      |      ^~~
wombats.cpp:3: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    3 | #pragma comment(linker, "/stack:200000000")
      |
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...