結果
| 問題 |
No.416 旅行会社
|
| コンテスト | |
| ユーザー |
 37zigen
|
| 提出日時 | 2016-08-28 04:28:06 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 996 ms / 4,000 ms |
| コード長 | 6,579 bytes |
| コンパイル時間 | 5,931 ms |
| コンパイル使用メモリ | 86,072 KB |
| 実行使用メモリ | 60,120 KB |
| 最終ジャッジ日時 | 2024-12-14 20:06:45 |
| 合計ジャッジ時間 | 14,890 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 21 |
ソースコード
package q4xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
public class N416 {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni(), m = ni(), Q = ni();
long[] es = new long[m];
for(int i = 0;i < m;i++){
es[i] = (long)ni()-1<<32|(long)ni()-1;
}
es = radixSort(es);
int[] time = new int[m];
Arrays.fill(time, m+2);
for(int i = 0;i < Q;i++){
long code = (long)ni()-1<<32|(long)ni()-1;
int ind = Arrays.binarySearch(es, code);
time[ind] = i+1;
}
long[][] ees = new long[m][];
for(int i = 0;i < m;i++){
ees[i] = new long[]{es[i], time[i]};
}
Arrays.sort(ees, new Comparator<long[]>() {
public int compare(long[] a, long[] b) {
return -Long.compare(a[1], b[1]);
}
});
int[] ret = new int[n];
DisjointSetOfList ds = new DisjointSetOfList(n);
for(int i = 0;i < m;i++){
int f = (int)(ees[i][0]>>>32);
int t = (int)(ees[i][0]);
if(ds.equiv(f, t))continue;
if(ds.equiv(f, 0)){
for(int r = ds.root(t);r != -1;r = ds.next[r]){
ret[r] = (int)ees[i][1];
}
}else if(ds.equiv(t, 0)){
for(int r = ds.root(f);r != -1;r = ds.next[r]){
ret[r] = (int)ees[i][1];
}
}
ds.union(f, t);
}
for(int i = 1;i < n;i++){
if(ret[i] == m+2)ret[i] = -1;
out.println(ret[i]);
}
}
public static class DisjointSetOfList {
public int[] upper;
public int[] next;
public int[] last;
public DisjointSetOfList(int n) {
upper = new int[n];
Arrays.fill(upper, -1);
next = new int[n];
last = new int[n];
Arrays.fill(next, -1);
for(int i = 0;i < n;i++){
last[i] = i;
}
}
public int root(int x) {
return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
}
public boolean equiv(int x, int y) {
return root(x) == root(y);
}
public boolean union(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (upper[y] < upper[x]) {
int d = x;
x = y;
y = d;
}
upper[x] += upper[y];
upper[y] = x;
next[last[x]] = y;
last[x] = last[y];
}
return x == y;
}
public int count() {
int ct = 0;
for (int u : upper)
if (u < 0)
ct++;
return ct;
}
}
public static class DJSet {
public int[] upper;
public DJSet(int n) {
upper = new int[n];
Arrays.fill(upper, -1);
}
public int root(int x) {
return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
}
public boolean equiv(int x, int y) {
return root(x) == root(y);
}
public boolean union(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (upper[y] < upper[x]) {
int d = x;
x = y;
y = d;
}
upper[x] += upper[y];
upper[y] = x;
}
return x == y;
}
public int count() {
int ct = 0;
for (int u : upper)
if (u < 0)
ct++;
return ct;
}
}
public static long[] radixSort(long[] f)
{
long[] to = new long[f.length];
{
int[] b = new int[65537];
for(int i = 0;i < f.length;i++)b[1+(int)(f[i]&0xffff)]++;
for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
for(int i = 0;i < f.length;i++)to[b[(int)(f[i]&0xffff)]++] = f[i];
long[] d = f; f = to;to = d;
}
{
int[] b = new int[65537];
for(int i = 0;i < f.length;i++)b[1+(int)(f[i]>>>16&0xffff)]++;
for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
for(int i = 0;i < f.length;i++)to[b[(int)(f[i]>>>16&0xffff)]++] = f[i];
long[] d = f; f = to;to = d;
}
{
int[] b = new int[65537];
for(int i = 0;i < f.length;i++)b[1+(int)(f[i]>>>32&0xffff)]++;
for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
for(int i = 0;i < f.length;i++)to[b[(int)(f[i]>>>32&0xffff)]++] = f[i];
long[] d = f; f = to;to = d;
}
{
int[] b = new int[65537];
for(int i = 0;i < f.length;i++)b[1+(int)(f[i]>>>48&0xffff)]++;
for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
for(int i = 0;i < f.length;i++)to[b[(int)(f[i]>>>48&0xffff)]++] = f[i];
long[] d = f; f = to;to = d;
}
return f;
}
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");
}
public static void main(String[] args) throws Exception { new N416().run(); }
private byte[] inbuf = new byte[1024];
private 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 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[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private int ni()
{
int num = 0, 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 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)); }
}