Submission #1098647
Source Code Expand
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.TreeMap;
public class Main implements Runnable{
static ContestScanner in;static Writer out;
public static void main(String[] args) {
new Thread(null, new Main(), "", 16 * 1024 * 1024).start();
}
public void run() {
try {
// in = new ContestScanner("in.txt");
// out = new Writer("out.txt");
in = new ContestScanner();
out = new Writer();
Main solve = new Main();
solve.solve();
in.close();
out.flush();
out.close();
} catch (IOException e) {
e.printStackTrace();
}
}
static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
static void m_sort(int[]a,int s,int sz,int[]b)
{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
static void m_sort(long[]a,int s,int sz,long[]b)
{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
static void swap(long[]a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
static void swap(int[]a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
static int binarySearchSmallerMax(int[]a,int v,int l,int r)
{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
static List<Integer>[]graph(int n){List<Integer>[]g=new List[n];
for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
void solve() throws NumberFormatException, IOException{
int n = in.nextInt();
int m = in.nextInt();
List<Edge>[] node = new List[n];
Pair[] vs = new Pair[n];
Queue<Integer>[] query = new Queue[n];
for(int i=0; i<n; i++){
query[i] = new ArrayDeque<>();
vs[i] = new Pair(0, i);
node[i] = new ArrayList<>();
}
for(int i=0; i<m; i++){
int a = in.nextInt()-1;
int b = in.nextInt()-1;
int c = in.nextInt();
Edge ea = new Edge(b, c);
Edge eb = new Edge(a, c);
ea.rev = eb;
eb.rev = ea;
node[a].add(ea);
node[b].add(eb);
}
mst = Prim.getMst(node);
long cost = Prim.cost;
int q = in.nextInt();
int[] qs = new int[q];
int[] qt = new int[q];
for(int i=0; i<q; i++){
int s = in.nextInt()-1;
int t = in.nextInt()-1;
qs[i] = s;
qt[i] = t;
query[s].add(i);
query[t].add(i);
vs[s].a++;
vs[t].a++;
}
int[] table = new int[n];
Arrays.sort(vs);
for(int i=0; i<n; i++){
table[vs[i].b] = i;
}
best = new int[n];
boolean[] used = new boolean[q];
long[] ans = new long[q];
for(int i=n-1; i>=0; i--){
final int v = vs[i].b;
if(vs[i].a == 0) continue;
dfs(v, -1, 0);
while(!query[v].isEmpty()){
final int qid = query[v].poll();
if(used[qid]) continue;
used[qid] = true;
int t;
if(v == qs[qid]){
t = qt[qid];
}else{
t = qs[qid];
}
vs[table[t]].a--;
ans[qid] = cost-best[t];
}
}
for(int i=0; i<q; i++){
out.println(ans[i]);
}
}
int[] best;
List<Edge>[] mst;
void dfs(int cur, int par, int max){
best[cur] = max;
for(Edge e: mst[cur]){
if(e.to == par) continue;
dfs(e.to, cur, Math.max(max, e.c));
}
}
}
class Prim{
static long cost;
static List<Edge>[] getMst(List<Edge>[] node){
final int n = node.length;
Queue<Edge> qu = new PriorityQueue<>();
List<Edge>[] res = new List[n];
for(int i=0; i<n; i++) res[i] = new ArrayList<>();
for(Edge e: node[0]) qu.add(e);
boolean[] used = new boolean[n];
used[0] = true;
cost = 0;
while(!qu.isEmpty()){
Edge e = qu.poll();
if(used[e.to]) continue;
used[e.to] = true;
final int from = e.rev.to;
res[from].add(e);
res[e.to].add(e.rev);
cost += e.c;
for(Edge ne: node[e.to]){
qu.add(ne);
}
}
return res;
}
}
class Edge implements Comparable<Edge>{
int to, c;
Edge rev;
Edge(int to, int c){
this.to = to;
this.c = c;
}
@Override
public int compareTo(Edge o) {
return Integer.compare(c, o.c);
}
}
class MultiSet<T> extends HashMap<T, Integer>{
@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
public void add(T key,int v){put(key,get(key)+v);}
public void add(T key){put(key,get(key)+1);}
public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
public MultiSet<T> merge(MultiSet<T> set)
{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
public void add(T key,int v){put(key,get(key)+v);}
public void add(T key){put(key,get(key)+1);}
public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
public int hashCode(){return hash;}
public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
}
class Timer{
long time;public void set(){time=System.currentTimeMillis();}
public long stop(){return time=System.currentTimeMillis()-time;}
public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
public Writer(String filename)throws IOException
{super(new BufferedWriter(new FileWriter(filename)));}
public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
private BufferedReader in;private int c=-2;
public ContestScanner()throws IOException
{in=new BufferedReader(new InputStreamReader(System.in));}
public ContestScanner(String filename)throws IOException
{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
public String nextToken()throws IOException {
StringBuilder sb=new StringBuilder();
while((c=in.read())!=-1&&Character.isWhitespace(c));
while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
return sb.toString();
}
public String readLine()throws IOException{
StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
return sb.toString();
}
public long nextLong()throws IOException,NumberFormatException
{return Long.parseLong(nextToken());}
public int nextInt()throws NumberFormatException,IOException
{return(int)nextLong();}
public double nextDouble()throws NumberFormatException,IOException
{return Double.parseDouble(nextToken());}
public void close() throws IOException {in.close();}
}
Submission Info
Submission Time |
|
Task |
A - Graph |
User |
threepipes_s |
Language |
Java8 (OpenJDK 1.8.0) |
Score |
500 |
Code Size |
9095 Byte |
Status |
MLE |
Exec Time |
2514 ms |
Memory |
301044 KB |
Compile Error
Note: ./Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.
Judge Result
Set Name |
Sample |
subtask1 |
subtask2 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
300 / 300 |
0 / 200 |
Status |
|
|
|
|
Set Name |
Test Cases |
Sample |
sample_1.txt, sample_2.txt |
subtask1 |
sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 |
sample_1.txt, sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt |
All |
sample_1.txt, sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_1.txt |
AC |
102 ms |
8584 KB |
sample_2.txt |
AC |
100 ms |
8584 KB |
subtask_1_1.txt |
AC |
128 ms |
9604 KB |
subtask_1_10.txt |
AC |
688 ms |
63144 KB |
subtask_1_11.txt |
AC |
103 ms |
8580 KB |
subtask_1_2.txt |
AC |
301 ms |
30348 KB |
subtask_1_3.txt |
AC |
1162 ms |
100784 KB |
subtask_1_4.txt |
AC |
162 ms |
15224 KB |
subtask_1_5.txt |
AC |
196 ms |
15868 KB |
subtask_1_6.txt |
AC |
497 ms |
36732 KB |
subtask_1_7.txt |
AC |
1145 ms |
100840 KB |
subtask_1_8.txt |
AC |
184 ms |
15484 KB |
subtask_1_9.txt |
AC |
212 ms |
18312 KB |
subtask_2_1.txt |
AC |
1518 ms |
100852 KB |
subtask_2_2.txt |
AC |
1504 ms |
100872 KB |
subtask_2_3.txt |
AC |
1532 ms |
100880 KB |
subtask_2_4.txt |
AC |
1539 ms |
101160 KB |
subtask_2_5.txt |
AC |
516 ms |
77324 KB |
subtask_2_6.txt |
AC |
583 ms |
26004 KB |
subtask_2_7.txt |
AC |
919 ms |
86568 KB |
subtask_2_8.txt |
AC |
1621 ms |
171332 KB |
subtask_3_1.txt |
MLE |
2479 ms |
300520 KB |
subtask_3_2.txt |
MLE |
2486 ms |
300596 KB |
subtask_3_3.txt |
AC |
1173 ms |
146256 KB |
subtask_3_4.txt |
AC |
1263 ms |
146384 KB |
subtask_3_5.txt |
AC |
1911 ms |
191372 KB |
subtask_3_6.txt |
AC |
2206 ms |
242636 KB |
subtask_3_7.txt |
MLE |
2489 ms |
300724 KB |
subtask_3_8.txt |
MLE |
2514 ms |
301044 KB |