oj.uz

답안 #1068076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068076 2024-08-21T07:09:17 Z kunzaZa183 웜뱃 (IOI13_wombats) C++17
55 / 100
 20000 ms 20788 KB 
    #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
     
    #include "wombats.h"
    #include <bits/stdc++.h>
    #include <utility>
    using namespace std;
     
     
    struct qry{
      pair<int,int> pos;
      int w;
      bool operator<(qry x) const{
        return w > x.w;
      }
    };
     
    int hori[5000][200],verti[5000][200];
    int dp[5000][200],r,c;
    int ans[200][200];
     
    bitset<200> alrdid;
     
    const int big = 1e9+7;
    void dij(int a,int b,int in){
      priority_queue<qry> pq;
      for(int i = 0; i < r; i++)
        for(int j = 0; j< c;j++)
          dp[i][j] = big;
     
        qry tmp;
        tmp.pos = {a,b};
        tmp.w = 0;
        pq.push(tmp);
     
      while(!pq.empty()) {
        qry x = pq.top();
        pq.pop();
        if(dp[x.pos.first][x.pos.second] == big) {
          dp[x.pos.first][x.pos.second] = x.w;
          qry sth;
          if(x.pos.second!=0) {
            sth.pos = {x.pos.first,x.pos.second - 1};
            sth.w = hori[sth.pos.first][sth.pos.second] + x.w;
            pq.push(sth);
          }
          if(x.pos.second != c - 1) {
            sth.pos = {x.pos.first, x.pos.second + 1};
            sth.w = hori[x.pos.first][x.pos.second] + x.w;
            pq.push(sth);
          }
          if(x.pos.first != 0) {
            sth.pos = {x.pos.first - 1,x.pos.second};
            sth.w = verti[sth.pos.first][sth.pos.second] + x.w;
            pq.push(sth);
          } 
        }
      }
     
      for(int i = 0; i < c;i++)
        ans[in][i] = dp[0][i];
    }
     
    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++)
          hori[i][j] = H[i][j], verti[i][j] = V[i][j];
      alrdid.reset();
    }
     
     
     
    void changeH(int P, int Q, int W) {
      hori[P][Q] = W;
      alrdid.reset();
    }
     
    void changeV(int P, int Q, int W) {
      verti[P][Q] = W;
      alrdid.reset();
    }
     
    int escape(int V1, int V2) {
      if(!alrdid[V2])
        dij(r-1,V2,V2);
      alrdid[V2] = 1;
      return ans[V2][V1];
    }

Compilation message

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: In function 'void dij(int, int, int)':
wombats.cpp:27:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   27 |       for(int i = 0; i < r; i++)
      |       ^~~
wombats.cpp:31:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   31 |         qry tmp;
      |         ^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 15960 KB Output is correct
2 Correct 38 ms 15964 KB Output is correct
3 Correct 74 ms 17488 KB Output is correct
4 Correct 40 ms 15960 KB Output is correct
5 Correct 40 ms 15964 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 40 ms 1364 KB Output is correct
12 Correct 1 ms 344 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 118 ms 936 KB Output is correct
2 Correct 234 ms 1220 KB Output is correct
3 Correct 203 ms 856 KB Output is correct
4 Correct 200 ms 856 KB Output is correct
5 Correct 196 ms 920 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 91 ms 916 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 519 ms 19804 KB Output is correct
2 Correct 945 ms 19804 KB Output is correct
3 Correct 525 ms 20052 KB Output is correct
4 Correct 547 ms 20788 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 860 KB Output is correct
2 Correct 227 ms 1216 KB Output is correct
3 Correct 199 ms 860 KB Output is correct
4 Correct 195 ms 916 KB Output is correct
5 Correct 195 ms 912 KB Output is correct
6 Correct 521 ms 19984 KB Output is correct
7 Correct 946 ms 19804 KB Output is correct
8 Correct 526 ms 19800 KB Output is correct
9 Correct 554 ms 20592 KB Output is correct
10 Correct 38 ms 15964 KB Output is correct
11 Correct 38 ms 15960 KB Output is correct
12 Correct 77 ms 17640 KB Output is correct
13 Correct 39 ms 16088 KB Output is correct
14 Correct 40 ms 15960 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 576 KB Output is correct
25 Correct 43 ms 1392 KB Output is correct
26 Correct 2 ms 344 KB Output is correct
27 Correct 92 ms 860 KB Output is correct
28 Execution timed out 20092 ms 20112 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 117 ms 860 KB Output is correct
2 Correct 230 ms 1216 KB Output is correct
3 Correct 195 ms 856 KB Output is correct
4 Correct 195 ms 860 KB Output is correct
5 Correct 197 ms 904 KB Output is correct
6 Correct 514 ms 19984 KB Output is correct
7 Correct 953 ms 19800 KB Output is correct
8 Correct 527 ms 19804 KB Output is correct
9 Correct 566 ms 20560 KB Output is correct
10 Correct 41 ms 15960 KB Output is correct
11 Correct 39 ms 15964 KB Output is correct
12 Correct 77 ms 17488 KB Output is correct
13 Correct 39 ms 15964 KB Output is correct
14 Correct 40 ms 15960 KB Output is correct
15 Correct 650 ms 19780 KB Output is correct
16 Execution timed out 20049 ms 20096 KB Time limit exceeded
17 Halted 0 ms 0 KB -