编程语言:Java
题目链接:http://poj.org/problem?id=3190
题解:数据量较大,不用Scanner可以节省接近1s的时间,我这里选择将元素本身的位置存入奶牛的类中,这样即使排序之后顺序乱了,最终还是能够按照输入的顺序输出其所在的牛舍,优先队列中存储最小奶牛们的截止时间,当新奶牛的初始时间比优先队列中最小的截止时间都要早的时候,就需要新开一个牛舍,否则就替换。
结果:AC
import java.io.*;
import java.util.Arrays;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) throws IOException {
in.nextToken();int n= (int) in.nval;
cow[] a=new cow[n];
int[] res=new int[n];
for(int i=0;i<n;i++){
in.nextToken();int l= (int) in.nval;
in.nextToken();int r= (int) in.nval;
a[i]=new cow(l,r,i);
}
Arrays.sort(a, new Comparator<cow>() {
@Override
public int compare(cow o1, cow o2) {
return o1.l-o2.l;
}
});
PriorityQueue<cow> que=new PriorityQueue<cow>(n , new Comparator<cow>() {
@Override
public int compare(cow o1, cow o2) {
return o1.r-o2.r;
}
});
int stall=1;
res[a[0].i]=stall;
que.add(a[0]);
for(int i=1;i<n;i++){
if(a[i].l>que.peek().r){
cow c=que.poll();
res[a[i].i]=res[c.i];
}else{
res[a[i].i]=++stall;
}
que.add(a[i]);
}
out.println(stall);
for(int i=0;i<n;i++){
out.println(res[i]);
}
out.flush();
}
}
class cow {
int l;
int r;
int i;
public cow(int l, int r,int i) {
this.l = l;
this.r = r;
this.i=i;
}
}