oj.uz

답안 #678807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678807 2023-01-06T15:34:26 Z jiahng 웜뱃 (IOI13_wombats) C++14
21 / 100
 1758 ms 24116 KB 
#include "wombats.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 200010
#define INF (ll)1e9
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;

int R,C;
int H[5000][200], V[5000][200], ss[5000][200];
int tmp[200][200],opt[200][200];
struct node{
    int s,e,m;
    int val[200][200];
    node *l,*r;
    bool leaf = 0;

    node(int _s,int _e){
        s = _s; e = _e; m = (s + e) / 2;

        if (e-s+1 > 20){
            l = new node(s,m); r = new node(m+1,e);
            merge();
        }else{
            leaf = 1;
            compleaf();
        }
    }
    void merge(){
        FOR(len,C-1,0){
            FOR(i,0,C-1) if (i + len < C){ 
                int j = i + len;
                val[i][j] = INF;
                int lb = (j>0?opt[i][j-1]:0);
                int rb = (i+1<C?opt[i+1][j]:C-1);
                FOR(k,opt[i][j-1], opt[i+1][j]){
                    int res = l->val[i][k] + r->val[k][j] + V[m][k];
                    if (res < val[i][j]){
                        opt[i][j] = k;
                        val[i][j] = res;
                    }
                }
            }
            FOR(i,0,C-1) if (i - len >= 0){ 
                int j = i - len;
                val[i][j] = INF;
                int lb = (j>0?opt[i][j-1]:0);
                int rb = (i+1<C?opt[i+1][j]:C-1);
                FOR(k,opt[i][j-1], opt[i+1][j]){
                    int res = l->val[i][k] + r->val[k][j] + V[m][k];
                    if (res < val[i][j]){
                        opt[i][j] = k;
                        val[i][j] = res;
                    }
                }
            }
        }
    }
        
    void updV(int row){
        if (leaf){
            compleaf(); return;
        }
        if (m < row) r->updV(row);
        else if (m > row) l->updV(row);

        merge();
    }
    void compleaf(){
        FOR(i,0,C-1) FOR(j,0,C-1) val[i][j] = abs(ss[e][i] - ss[e][j]);
        DEC(l,e-1,s){
            FOR(i,0,C-1) FOR(j,0,C-1){
                tmp[i][j] = INF;
                FOR(k,0,C-1){
                    tmp[i][j] = min(tmp[i][j],
                            val[k][j] + abs(ss[l][k] - ss[l][i]) + V[l][k]);
                }
            }
            FOR(i,0,C-1) FOR(j,0,C-1) val[i][j] = tmp[i][j];
        }
    }

    void updH(int row){
        if (leaf){
            compleaf();
            return;
        }
        if (row > m) r->updH(row);
        else l->updH(row);
        merge();
    }
}*root;
void init(int R, int C, int H[5000][200], int V[5000][200]) {
    ::R = R; ::C = C;
    FOR(i,0,R-1) FOR(j,0,C-1){
        ::H[i][j] = H[i][j];
        ::V[i][j] = V[i][j];
    }
    FOR(i,0,R-1){
        ss[i][0] = 0;
        
        FOR(j,1,C-1){
            ss[i][j] = ss[i][j-1] + H[i][j-1];
        }
    }
    root = new node(0,R-1);

    /*
    FOR(i,0,C-1){
        FOR(j,0,C-1) cout << root->val[i][j] << ' ';
        cout << '\n';
    }
    */
}

void changeH(int P, int Q, int W) {
    H[P][Q] = W; 
    FOR(j,1,C-1) ss[P][j] = ss[P][j-1] + H[P][j-1];

    root->updH(P);
}

void changeV(int P, int Q, int W) {
    V[P][Q] = W;
    root->updV(P);
}

int escape(int V1, int V2) {
    return root->val[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]
   15 |  int res;
      |      ^~~
wombats.cpp: In member function 'void node::merge()':
wombats.cpp:56:21: warning: unused variable 'lb' [-Wunused-variable]
   56 |                 int lb = (j>0?opt[i][j-1]:0);
      |                     ^~
wombats.cpp:57:21: warning: unused variable 'rb' [-Wunused-variable]
   57 |                 int rb = (i+1<C?opt[i+1][j]:C-1);
      |                     ^~
wombats.cpp:69:21: warning: unused variable 'lb' [-Wunused-variable]
   69 |                 int lb = (j>0?opt[i][j-1]:0);
      |                     ^~
wombats.cpp:70:21: warning: unused variable 'rb' [-Wunused-variable]
   70 |                 int rb = (i+1<C?opt[i+1][j]:C-1);
      |                     ^~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 20176 KB Output is correct
2 Correct 10 ms 20180 KB Output is correct
3 Correct 74 ms 22956 KB Output is correct
4 Correct 10 ms 20180 KB Output is correct
5 Correct 12 ms 20180 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 62 ms 2708 KB Output is correct
12 Correct 1 ms 468 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1701 ms 1604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 24116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1698 ms 1732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1758 ms 1732 KB Output isn't correct
2 Halted 0 ms 0 KB -