結果
| 問題 | No.529 帰省ラッシュ |
| ユーザー |
 uwi
|
| 提出日時 | 2017-06-09 23:09:37 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 1,203 ms / 4,500 ms |
| コード長 | 14,736 bytes |
| コンパイル時間 | 4,919 ms |
| コンパイル使用メモリ | 83,656 KB |
| 実行使用メモリ | 99,624 KB |
| 最終ジャッジ日時 | 2023-08-22 10:30:31 |
| 合計ジャッジ時間 | 18,972 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 43 ms
49,604 KB |
| testcase_01 | AC | 44 ms
49,660 KB |
| testcase_02 | AC | 45 ms
50,012 KB |
| testcase_03 | AC | 44 ms
49,672 KB |
| testcase_04 | AC | 101 ms
52,604 KB |
| testcase_05 | AC | 101 ms
52,892 KB |
| testcase_06 | AC | 93 ms
52,524 KB |
| testcase_07 | AC | 91 ms
52,484 KB |
| testcase_08 | AC | 784 ms
73,852 KB |
| testcase_09 | AC | 921 ms
70,724 KB |
| testcase_10 | AC | 1,024 ms
86,100 KB |
| testcase_11 | AC | 1,203 ms
90,396 KB |
| testcase_12 | AC | 637 ms
64,880 KB |
| testcase_13 | AC | 775 ms
64,648 KB |
| testcase_14 | AC | 694 ms
68,296 KB |
| testcase_15 | AC | 1,180 ms
86,788 KB |
| testcase_16 | AC | 1,174 ms
99,624 KB |
| testcase_17 | AC | 904 ms
85,460 KB |
| testcase_18 | AC | 925 ms
83,828 KB |
| testcase_19 | AC | 908 ms
88,612 KB |
ソースコード
package contest170609;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;
public class E {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), m = ni(), Q = ni();
int[] from = new int[m];
int[] to = new int[m];
for(int i = 0;i < m;i++){
from[i] = ni()-1;
to[i] = ni()-1;
}
int[][] g = packU(n, from, to);
int[] clus = decomposeToBECC(g);
int[][] cg = condense(g, clus);
int[][] pars = parents3(cg, 0);
int[] par = pars[0], ord = pars[1], dep = pars[2];
HeavyLightDecomposition hld = new HeavyLightDecomposition(cg, par, ord, dep);
List<Queue<Integer>> pqs = new ArrayList<>();
for(int i = 0;i < cg.length;i++)pqs.add(new PriorityQueue<>());
SegmentTreeRMQPos[] sts = new SegmentTreeRMQPos[hld.cluspath.length];
for(int i = 0;i < hld.cluspath.length;i++){
sts[i] = new SegmentTreeRMQPos(hld.cluspath[i].length);
}
for(int z = 0;z < Q;z++){
int type = ni();
if(type == 1){
int u = clus[ni()-1], w = ni();
Integer cur = pqs.get(u).peek();
pqs.get(u).add(-w);
if(cur == null || -w < cur){
sts[hld.clus[u]].update(hld.clusiind[u], -w);
}
}else{
int a = clus[ni()-1], b = clus[ni()-1];
int lca = hld.lca(a, b);
int tempmin = 1;
int argmin = -1;
{
int x = a;
int cx = hld.clus[x]; // cluster
int ind = hld.clusiind[x]; // pos in cluster
while(cx != hld.clus[lca]){
int minval = sts[cx].minx(0, ind+1);
if(minval < tempmin){
tempmin = minval;
argmin = hld.cluspath[cx][sts[cx].minpos];
}
int con = par[hld.cluspath[cx][0]];
ind = hld.clusiind[con];
cx = hld.clus[con];
}
int minval = sts[cx].minx(hld.clusiind[lca], ind+1);
if(minval < tempmin){
tempmin = minval;
argmin = hld.cluspath[cx][sts[cx].minpos];
}
}
{
int x = b;
int cx = hld.clus[x]; // cluster
int ind = hld.clusiind[x]; // pos in cluster
while(cx != hld.clus[lca]){
int minval = sts[cx].minx(0, ind+1);
if(minval < tempmin){
tempmin = minval;
argmin = hld.cluspath[cx][sts[cx].minpos];
}
int con = par[hld.cluspath[cx][0]];
ind = hld.clusiind[con];
cx = hld.clus[con];
}
int minval = sts[cx].minx(hld.clusiind[lca], ind+1);
if(minval < tempmin){
tempmin = minval;
argmin = hld.cluspath[cx][sts[cx].minpos];
}
}
out.println(argmin == -1 ? -1 : -tempmin);
if(argmin != -1){
pqs.get(argmin).poll();
Integer cur = pqs.get(argmin).peek();
if(cur == null){
sts[hld.clus[argmin]].update(hld.clusiind[argmin], Integer.MAX_VALUE);
}else{
sts[hld.clus[argmin]].update(hld.clusiind[argmin], cur);
}
}
}
}
}
public static class SegmentTreeRMQPos {
public int M, H, N;
public int[] st;
public int[] pos;
public SegmentTreeRMQPos(int n)
{
N = n;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
st = new int[M];
pos = new int[M];
for(int i = 0;i < N;i++)pos[H+i] = i;
Arrays.fill(st, 0, M, Integer.MAX_VALUE);
for(int i = H-1;i >= 1;i--)propagate(i);
}
public SegmentTreeRMQPos(int[] a)
{
N = a.length;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
st = new int[M];
pos = new int[M];
for(int i = 0;i < N;i++){
st[H+i] = a[i];
pos[H+i] = i;
}
Arrays.fill(st, H+N, M, Integer.MAX_VALUE);
for(int i = H-1;i >= 1;i--)propagate(i);
}
public void update(int pos, int x)
{
st[H+pos] = x;
for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
}
private void propagate(int i)
{
if(st[2*i] <= st[2*i+1]){
st[i] = st[2*i];
pos[i] = pos[2*i];
}else{
st[i] = st[2*i+1];
pos[i] = pos[2*i+1];
}
}
public int minpos;
public int minval;
public int minx(int l, int r){
minval = Integer.MAX_VALUE;
minpos = -1;
if(l >= r)return minval;
while(l != 0){
int f = l&-l;
if(l+f > r)break;
int v = st[(H+l)/f];
if(v < minval){
minval = v;
minpos = pos[(H+l)/f];
}
l += f;
}
while(l < r){
int f = r&-r;
int v = st[(H+r)/f-1];
if(v < minval){
minval = v;
minpos = pos[(H+r)/f-1];
}
r -= f;
}
return minval;
}
public int min(int l, int r){
minpos = -1;
minval = Integer.MAX_VALUE;
min(l, r, 0, H, 1);
return minval;
}
private void min(int l, int r, int cl, int cr, int cur)
{
if(l <= cl && cr <= r){
if(st[cur] < minval){
minval = st[cur];
minpos = pos[cur];
}
}else{
int mid = cl+cr>>>1;
if(cl < r && l < mid)min(l, r, cl, mid, 2*cur);
if(mid < r && l < cr)min(l, r, mid, cr, 2*cur+1);
}
}
}
public static class HeavyLightDecomposition {
public int[] clus;
public int[][] cluspath;
public int[] clusiind;
public int[] par, dep;
public HeavyLightDecomposition(int[][] g, int[] par, int[] ord, int[] dep)
{
init(g, par, ord, dep);
}
public void init(int[][] g, int[] par, int[] ord, int[] dep)
{
clus = decomposeToHeavyLight(g, par, ord);
cluspath = clusPaths(clus, ord);
clusiind = clusIInd(cluspath, g.length);
this.par = par;
this.dep = dep;
}
public static int[] decomposeToHeavyLight(int[][] g, int[] par, int[] ord)
{
int n = g.length;
int[] size = new int[n];
Arrays.fill(size, 1);
for(int i = n-1;i > 0;i--)size[par[ord[i]]] += size[ord[i]];
int[] clus = new int[n];
Arrays.fill(clus, -1);
int p = 0;
for(int i = 0;i < n;i++){
int u = ord[i];
if(clus[u] == -1)clus[u] = p++;
// centroid path (not heavy path)
int argmax = -1;
for(int v : g[u]){
if(par[u] != v && (argmax == -1 || size[v] > size[argmax]))argmax = v;
}
if(argmax != -1)clus[argmax] = clus[u];
}
return clus;
}
public static int[][] clusPaths(int[] clus, int[] ord)
{
int n = clus.length;
int[] rp = new int[n];
int sup = 0;
for(int i = 0;i < n;i++){
rp[clus[i]]++;
sup = Math.max(sup, clus[i]);
}
sup++;
int[][] row = new int[sup][];
for(int i = 0;i < sup;i++)row[i] = new int[rp[i]];
for(int i = n-1;i >= 0;i--){
row[clus[ord[i]]][--rp[clus[ord[i]]]] = ord[i];
}
return row;
}
public static int[] clusIInd(int[][] clusPath, int n)
{
int[] iind = new int[n];
for(int[] path : clusPath){
for(int i = 0;i < path.length;i++){
iind[path[i]] = i;
}
}
return iind;
}
public int lca(int x, int y)
{
int rx = cluspath[clus[x]][0];
int ry = cluspath[clus[y]][0];
while(clus[x] != clus[y]){
if(dep[rx] > dep[ry]){
x = par[rx];
rx = cluspath[clus[x]][0];
}else{
y = par[ry];
ry = cluspath[clus[y]][0];
}
}
return clusiind[x] > clusiind[y] ? y : x;
}
public int ancestor(int x, int v)
{
while(x != -1){
if(v <= clusiind[x])return cluspath[clus[x]][clusiind[x]-v];
v -= clusiind[x]+1;
x = par[cluspath[clus[x]][0]];
}
return x;
}
///// templates
/**
* xとその先祖ancについて経路x-ancでのクエリを処理するテンプレ
* @param x
* @param anc
*/
public void query(int x, int anc)
{
int cx = clus[x]; // cluster
int ind = clusiind[x]; // pos in cluster
while(cx != clus[anc]){
// TODO クラスタcxの0~indについて逆向きにクエリ処理
// st[cx].add(0, ind+1, v);
int con = par[cluspath[cx][0]];
ind = clusiind[con];
cx = clus[con];
}
// TODO clusiind[anc]~indについて逆向きにクエリ処理
// st[cx].add(clusiind[anc], ind+1, v);
}
}
public static int lca2(int a, int b, int[][] spar, int[] depth) {
if (depth[a] < depth[b]) {
b = ancestor(b, depth[b] - depth[a], spar);
} else if (depth[a] > depth[b]) {
a = ancestor(a, depth[a] - depth[b], spar);
}
if (a == b)
return a;
int sa = a, sb = b;
for (int low = 0, high = depth[a], t = Integer.highestOneBit(high), k = Integer
.numberOfTrailingZeros(t); t > 0; t >>>= 1, k--) {
if ((low ^ high) >= t) {
if (spar[k][sa] != spar[k][sb]) {
low |= t;
sa = spar[k][sa];
sb = spar[k][sb];
} else {
high = low | t - 1;
}
}
}
return spar[0][sa];
}
protected static int ancestor(int a, int m, int[][] spar) {
for (int i = 0; m > 0 && a != -1; m >>>= 1, i++) {
if ((m & 1) == 1)
a = spar[i][a];
}
return a;
}
public static int[][] logstepParents(int[] par) {
int n = par.length;
int m = Integer.numberOfTrailingZeros(Integer.highestOneBit(n - 1)) + 1;
int[][] pars = new int[m][n];
pars[0] = par;
for (int j = 1; j < m; j++) {
for (int i = 0; i < n; i++) {
pars[j][i] = pars[j - 1][i] == -1 ? -1 : pars[j - 1][pars[j - 1][i]];
}
}
return pars;
}
public static int[][] parents3(int[][] g, int root) {
int n = g.length;
int[] par = new int[n];
Arrays.fill(par, -1);
int[] depth = new int[n];
depth[0] = 0;
int[] q = new int[n];
q[0] = root;
for (int p = 0, r = 1; p < r; p++) {
int cur = q[p];
for (int nex : g[cur]) {
if (par[cur] != nex) {
q[r++] = nex;
par[nex] = cur;
depth[nex] = depth[cur] + 1;
}
}
}
return new int[][] { par, q, depth };
}
public static int[][] condense(int[][] g, int[] clus)
{
int n = g.length;
int m = 0;
for(int i = 0;i < n;i++)m = Math.max(m, clus[i]);
m++;
int[] cp = new int[m];
for(int i = 0;i < n;i++){
cp[clus[i]] += g[i].length;
}
int[][] c = new int[m][];
for(int i = 0;i < m;i++){
c[i] = new int[cp[i]];
}
for(int i = 0;i < n;i++){
for(int j = 0;j < g[i].length;j++){
c[clus[i]][--cp[clus[i]]] = clus[g[i][j]];
}
}
for(int i = 0;i < m;i++){
Arrays.sort(c[i]);
int jp = 0;
for(int j = 0;j < c[i].length;j++){
if((j == 0 || c[i][j] != c[i][j-1]) && c[i][j] != i){
c[i][jp++] = c[i][j];
}
}
c[i] = Arrays.copyOf(c[i], jp);
}
return c;
}
public static int[] decomposeToBECC(int[][] g)
{
int n = g.length;
boolean[] visited = new boolean[n];
int[] ord = new int[n];
int[] low = new int[n];
int[] ids = new int[n];
int[] inds = new int[n];
int[] parct = new int[n];
int pos = 0;
for(int i = 0;i < n;i++){
if(!visited[i]){
ids[0] = i;
inds[0] = 0;
int sp = 1;
while(sp > 0){
int cur = ids[sp-1];
if(inds[sp-1] == 0){
visited[cur] = true;
ord[cur] = low[cur] = pos++;
parct[sp-1] = 0;
}
if(inds[sp-1] == g[cur].length){
if(sp-2 >= 0)low[ids[sp-2]] = Math.min(low[ids[sp-2]], low[cur]);
sp--;
continue;
}
int next = g[cur][inds[sp-1]];
if(!visited[next]){
ids[sp] = next;
inds[sp] = 0;
inds[sp-1]++;
sp++;
continue;
}else if(sp-2 >= 0 && (next != ids[sp-2] || ++parct[sp-1] >= 2)){
low[cur] = Math.min(low[cur], ord[next]);
}
inds[sp-1]++;
}
}
}
int[] clus = new int[n];
Arrays.fill(clus, -1);
int[] q = new int[n];
int cnum = 0;
for(int i = 0;i < n;i++){
if(clus[i] == -1){
int p = 0;
q[p++] = i;
clus[i] = cnum++;
for(int r = 0;r < p;r++){
int cur = q[r];
for(int next : g[cur]){
if(clus[next] == -1){
clus[next] = ord[cur] < low[next] ? cnum++ : clus[cur];
q[p++] = next;
}
}
}
}
}
return clus;
}
static int[][] packU(int n, int[] from, int[] to) {
int[][] g = new int[n][];
int[] p = new int[n];
for (int f : from)
p[f]++;
for (int t : to)
p[t]++;
for (int i = 0; i < n; i++)
g[i] = new int[p[i]];
for (int i = 0; i < from.length; i++) {
g[from[i]][--p[from[i]]] = to[i];
g[to[i]][--p[to[i]]] = from[i];
}
return g;
}
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
public static void main(String[] args) throws Exception { new E().run(); }
private byte[] inbuf = new byte[1024];
public int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private char[][] nm(int n, int m) {
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private int ni() { return (int)nl(); }
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}