結果
| 問題 | No.953 席 |
| ユーザー |
 uwi
|
| 提出日時 | 2019-12-16 00:29:12 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 564 ms / 2,000 ms |
| コード長 | 10,722 bytes |
| コンパイル時間 | 4,131 ms |
| コンパイル使用メモリ | 92,436 KB |
| 実行使用メモリ | 63,480 KB |
| 最終ジャッジ日時 | 2024-07-02 18:32:25 |
| 合計ジャッジ時間 | 16,597 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 25 |
ソースコード
package adv2019;
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;
public class D16 {
InputStream is;
PrintWriter out;
String INPUT = "";
int[] anss;
LST lst;
int[] fnei;
LST lstnei;
PriorityQueue<long[]> exit;
int[] times, durs;
int n;
int K1, K2;
void solve()
{
n = ni();
K1 = ni()-1;
K2 = ni()-1;
int Q = ni();
fnei = new int[n];
lst = new LST(n);
lst.setRange(n);
lstnei = new LST(n);
lstnei.setRange(n);
exit = new PriorityQueue<>((x, y) -> Long.compare(x[0], y[0]));
int waitingHead = 0;
anss = new int[Q];
times = new int[Q];
durs = new int[Q];
for(int z = 0;z < Q;z++){
times[z] = ni();
durs[z] = ni();
}
for(int z = 0;z < Q;z++){
while(!exit.isEmpty() && exit.peek()[0] <= times[z]){
long thetime = exit.peek()[0];
while(!exit.isEmpty() && exit.peek()[0] == thetime){
remove(anss[(int)exit.poll()[1]]);
}
// tr("thetime", thetime, lst, waitingHead);
while(waitingHead < z && search() != -1){
sit(waitingHead++, thetime);
}
}
// tr(z, search());
if(waitingHead == z && search() != -1){
sit(waitingHead++, times[z]);
}
}
while(!exit.isEmpty()){
long thetime = exit.peek()[0];
// tr("thetime", thetime, lst, waitingHead);
while(!exit.isEmpty() && exit.peek()[0] == thetime){
// tr("rem", exit.peek());
remove(anss[(int)exit.poll()[1]]);
}
while(waitingHead < Q && search() != -1){
// tr("sit", waitingHead);
sit(waitingHead++, thetime);
}
}
for(int v : anss){
out.println(v+1);
}
}
void sit(int x, long time)
{
int pos = search();
assert pos != -1;
lst.unset(pos);
for(int i = Math.max(0, pos-1);i <= Math.min(n-1, pos+1);i++){
fnei[i]++;
lstnei.unset(i);
}
anss[x] = pos;
exit.add(new long[]{time + durs[x], x});
}
void remove(int pos)
{
lst.set(pos);
for(int i = Math.max(0, pos-1);i <= Math.min(n-1, pos+1);i++){
if(--fnei[i] == 0){
lstnei.set(i);
}
}
}
int search()
{
if(K1 < K2){
int pre = lstnei.prev(K1);
int nex = lstnei.next(K2);
if(pre != -1 && nex != -1){
if(K1-pre <= nex-K2){
return pre;
}else{
return nex;
}
}else if(pre == -1 && nex != -1){
return nex;
}else if(nex == -1 && pre != -1){
return pre;
}
pre = lst.prev(K1);
nex = lst.next(K2);
if(pre != -1 && nex != -1){
if(K1-pre <= nex-K2){
return pre;
}else{
return nex;
}
}else if(pre == -1 && nex != -1){
return nex;
}else if(nex == -1 && pre != -1){
return pre;
}
}else{
int pre = lstnei.prev(K2);
int nex = lstnei.next(K1);
if(pre != -1 && nex != -1){
if(K2-pre < nex-K1){
return pre;
}else{
return nex;
}
}else if(pre == -1 && nex != -1){
return nex;
}else if(nex == -1 && pre != -1){
return pre;
}
pre = lst.prev(K2);
nex = lst.next(K1);
if(pre != -1 && nex != -1){
if(K2-pre < nex-K1){
return pre;
}else{
return nex;
}
}else if(pre == -1 && nex != -1){
return nex;
}else if(nex == -1 && pre != -1){
return pre;
}
}
return -1;
}
public static class SegmentTreeRMQ {
public int M, H, N;
public int[] st;
public SegmentTreeRMQ(int n)
{
N = n;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
st = new int[M];
Arrays.fill(st, 0, M, Integer.MAX_VALUE);
}
public SegmentTreeRMQ(int[] a)
{
N = a.length;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
st = new int[M];
for(int i = 0;i < N;i++){
st[H+i] = a[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)
{
st[i] = Math.min(st[2*i], st[2*i+1]);
}
public int minx(int l, int r){
int min = Integer.MAX_VALUE;
if(l >= r)return min;
while(l != 0){
int f = l&-l;
if(l+f > r)break;
int v = st[(H+l)/f];
if(v < min)min = v;
l += f;
}
while(l < r){
int f = r&-r;
int v = st[(H+r)/f-1];
if(v < min)min = v;
r -= f;
}
return min;
}
public int min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}
private int min(int l, int r, int cl, int cr, int cur)
{
if(l <= cl && cr <= r){
return st[cur];
}else{
int mid = cl+cr>>>1;
int ret = Integer.MAX_VALUE;
if(cl < r && l < mid){
ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
}
if(mid < r && l < cr){
ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
}
return ret;
}
}
public int firstle(int l, int v) {
int cur = H+l;
while(true){
if(st[cur] <= v){
if(cur < H){
cur = 2*cur;
}else{
return cur-H;
}
}else{
cur++;
if((cur&cur-1) == 0)return -1;
if((cur&1)==0)cur>>>=1;
}
}
}
public int lastle(int l, int v) {
int cur = H+l;
while(true){
if(st[cur] <= v){
if(cur < H){
cur = 2*cur+1;
}else{
return cur-H;
}
}else{
if((cur&cur-1) == 0)return -1;
cur--;
if((cur&1)==1)cur>>>=1;
}
}
}
}
public static class LST {
public long[][] set;
public int n;
// public int size;
public LST(int n) {
this.n = n;
int d = 1;
for(int m = n;m > 1;m>>>=6, d++);
set = new long[d][];
for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){
set[i] = new long[m+1];
}
// size = 0;
}
// [0,r)
public LST setRange(int r)
{
for(int i = 0;i < set.length;i++, r=r+63>>>6){
for(int j = 0;j < r>>>6;j++){
set[i][j] = -1L;
}
if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;
}
return this;
}
// [0,r)
public LST unsetRange(int r)
{
if(r >= 0){
for(int i = 0;i < set.length;i++, r=r+63>>>6){
for(int j = 0;j < r+63>>>6;j++){
set[i][j] = 0;
}
if((r&63) != 0)set[i][r>>>6] &= ~((1L<<r)-1);
}
}
return this;
}
public LST set(int pos)
{
if(pos >= 0 && pos < n){
// if(!get(pos))size++;
for(int i = 0;i < set.length;i++, pos>>>=6){
set[i][pos>>>6] |= 1L<<pos;
}
}
return this;
}
public LST unset(int pos)
{
if(pos >= 0 && pos < n){
// if(get(pos))size--;
for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){
set[i][pos>>>6] &= ~(1L<<pos);
}
}
return this;
}
public boolean get(int pos)
{
return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;
}
public LST toggle(int pos)
{
return get(pos) ? unset(pos) : set(pos);
}
public int prev(int pos)
{
for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){
int pre = prev(set[i][pos>>>6], pos&63);
if(pre != -1){
pos = pos>>>6<<6|pre;
while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);
return pos;
}
}
return -1;
}
public int next(int pos)
{
for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){
int nex = next(set[i][pos>>>6], pos&63);
if(nex != -1){
pos = pos>>>6<<6|nex;
while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);
return pos;
}
}
return -1;
}
private static int prev(long set, int n)
{
long h = set<<~n;
if(h == 0L)return -1;
return -Long.numberOfLeadingZeros(h)+n;
}
private static int next(long set, int n)
{
long h = set>>>n;
if(h == 0L)return -1;
return Long.numberOfTrailingZeros(h)+n;
}
@Override
public String toString()
{
List<Integer> list = new ArrayList<Integer>();
for(int pos = next(0);pos != -1;pos = next(pos+1)){
list.add(pos);
}
return list.toString();
}
}
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 D16().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)); }
}