oj.uz

답안 #501955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
501955 2022-01-04T23:13:42 Z ETK Dungeon 2 (JOI16_dungeon2) C++14
0 / 100
 8 ms 1196 KB 
#include "dungeon2.h"
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a);i <= (b);++i)
using namespace std;
const int inf = 0x3f3f3f3f;
int d[205],T[205][205],cnt = 1,dis[205][205],ans[205];
//1: Edges on tree, 3: Reverse of 1, 2: nontree edges
int type[205][205];
void dfs(int x){
    d[x] = NumberOfRoads();
    rep(i,1,d[x]){
        Move(i,2);
        int col = Color(),lst = LastRoad();
        type[x][i] = col;
        if(col == 1){//not visited yet
            T[x][i] = ++cnt;
            dfs(cnt);
            type[T[x][i]][lst] = 3;
            T[T[x][i]][lst] = -1;
        }else if(col == 2){
            T[x][i] = 0;
        }
        //Going back
        Move(lst,col == 1 ? 3:col);
    }
}
//用三进制分解找到非树边的编号
void work(int x,int pow3){
    rep(i,1,d[x]){
        if(type[x][i] != 3){
            Move(i,x/pow3%3+1);
            int lst = LastRoad();
            if(type[x][i] == 1)work(T[x][i],pow3);
            else T[x][i] += pow3 * (Color() - 1);
            Move(lst,Color());
        }
    }
}
void Inspect(int R){
    memset(T,-1,sizeof(T));
    dfs(1);
    int now = 1;
    rep(i,0,4){
        work(1,now);
        now *= 3;
    }
    memset(dis,0x3f,sizeof(dis));
    rep(i,1,cnt)rep(j,1,d[i])if(T[i][j] != -1)
        dis[i][T[i][j]] = 1;
    rep(k,1,cnt)rep(i,1,cnt)rep(j,1,cnt){
        dis[i][j] = min(dis[i][j],dis[i][k] + dis[k][j]);
    }
    rep(i,1,cnt)rep(j,i+1,cnt)if(dis[i][j] != inf)
        ans[dis[i][j]]++;
    rep(i,1,R) Answer(i,ans[i]);
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 716 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 588 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 1196 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -