oj.uz

Submission #257655

# Submission time Handle Problem Language Result Execution time Memory
257655 2020-08-04T14:03:01 Z davi_bart Wombats (IOI13_wombats) C++14
39 / 100
 20000 ms 42744 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "wombats.h"
using namespace std;
typedef long long ll;
int h[5000][200],v[5000][200];
int ans[5000][200][200];
int r,c;
struct node{
  int r,c,d,fin;
  bool operator<(const node &x)const {
    return d<x.d;
  }
  bool operator>(const node &x)const {
    return d>x.d;
  }
};
void calc(){
  for(int i=0;i<r;i++){
    for(int j=0;j<c;j++){
      for(int x=0;x<c;x++)ans[i][j][x]=-1;
    }
  }
  priority_queue<node,vector<node>,greater<node> >q;
  for(int i=0;i<c;i++)q.push({r-1,i,0,i});
  while(!q.empty()){
    node x=q.top();
    q.pop();
    if(ans[x.r][x.c][x.fin]>=0)continue;
    ans[x.r][x.c][x.fin]=x.d;
    if(x.c>0)q.push({x.r,x.c-1,x.d+h[x.r][x.c-1],x.fin});
    if(x.c<c-1)q.push({x.r,x.c+1,x.d+h[x.r][x.c],x.fin});
    if(x.r>0)q.push({x.r-1,x.c,x.d+v[x.r-1][x.c],x.fin});
  }
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
    for(int i=0;i<5000;i++){
      for(int j=0;j<200;j++){
        h[i][j]=H[i][j];
        v[i][j]=V[i][j];
      }
    }
    r=R;
    c=C;
    calc();
}

void changeH(int P, int Q, int W) {
  h[P][Q]=W;
  calc();
}

void changeV(int P, int Q, int W) {
  v[P][Q]=W;
  calc();
}

int escape(int V1, int V2) {
    return ans[0][V1][V2];
}

Compilation message

grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 33536 KB Output is correct
2 Correct 211 ms 33664 KB Output is correct
3 Correct 291 ms 36344 KB Output is correct
4 Correct 210 ms 33664 KB Output is correct
5 Correct 208 ms 33664 KB Output is correct
6 Correct 6 ms 8192 KB Output is correct
7 Correct 5 ms 8192 KB Output is correct
8 Correct 5 ms 8192 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 8192 KB Output is correct
2 Correct 5 ms 8192 KB Output is correct
3 Correct 5 ms 8192 KB Output is correct
4 Correct 8 ms 8704 KB Output is correct
5 Correct 7 ms 8576 KB Output is correct
6 Correct 7 ms 8576 KB Output is correct
7 Correct 8 ms 8828 KB Output is correct
8 Correct 8 ms 8576 KB Output is correct
9 Correct 8 ms 8704 KB Output is correct
10 Correct 8 ms 8576 KB Output is correct
11 Correct 100 ms 11128 KB Output is correct
12 Correct 9 ms 8576 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 20039 ms 19100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1296 ms 41352 KB Output is correct
2 Correct 1744 ms 41464 KB Output is correct
3 Correct 1294 ms 41464 KB Output is correct
4 Correct 1306 ms 42744 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 20095 ms 18860 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 20054 ms 19148 KB Time limit exceeded
2 Halted 0 ms 0 KB -