結果
| 問題 | No.1270 Range Arrange Query |
| ユーザー |
 uwi
|
| 提出日時 | 2020-10-23 22:59:13 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
AC
|
| 実行時間 | 1,336 ms / 7,000 ms |
| コード長 | 15,493 bytes |
| コンパイル時間 | 4,908 ms |
| コンパイル使用メモリ | 92,964 KB |
| 実行使用メモリ | 55,252 KB |
| 最終ジャッジ日時 | 2024-07-21 12:08:23 |
| 合計ジャッジ時間 | 14,576 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 68 ms
38,152 KB |
| testcase_01 | AC | 71 ms
37,904 KB |
| testcase_02 | AC | 69 ms
38,140 KB |
| testcase_03 | AC | 75 ms
37,840 KB |
| testcase_04 | AC | 73 ms
38,024 KB |
| testcase_05 | AC | 76 ms
38,208 KB |
| testcase_06 | AC | 244 ms
45,816 KB |
| testcase_07 | AC | 983 ms
55,252 KB |
| testcase_08 | AC | 324 ms
48,540 KB |
| testcase_09 | AC | 771 ms
51,528 KB |
| testcase_10 | AC | 794 ms
54,824 KB |
| testcase_11 | AC | 1,336 ms
53,640 KB |
| testcase_12 | AC | 1,311 ms
53,268 KB |
| testcase_13 | AC | 1,317 ms
53,304 KB |
| testcase_14 | AC | 187 ms
41,776 KB |
| testcase_15 | AC | 280 ms
47,500 KB |
| testcase_16 | AC | 291 ms
47,672 KB |
| testcase_17 | AC | 311 ms
42,288 KB |
ソースコード
package contest201023;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class G {
InputStream is;
FastWriter out;
String INPUT = "";
public void solve()
{
int n = ni(), Q = ni();
int[] a = na(n);
int[][] qs = new int[Q][];
for(int i = 0;i < Q;i++){
qs[i] = new int[]{ni()-1, ni()-1};
}
long[] pack = sqrtSort(qs, n);
int L = 0, R = -1;
long sum = 0;
long[] rets = new long[Q];
int[] prefix = new int[n+4];
int[] suffix = new int[n+4];
StarrySkyTreeL sst = new StarrySkyTreeL(n+1);
for(int i = n-1;i >= 0;i--){
sum += sumFenwick(suffix, a[i]-1);
addFenwick(suffix, a[i], 1);
sst.add(a[i]+1, n+1, 1);
}
for(long pa : pack){
int ind = (int)(pa&(1<<25)-1);
int ql = qs[ind][0], qr = qs[ind][1];
while(R < qr){
R++;
addFenwick(suffix, a[R], -1);
sum -= sumFenwick(suffix, a[R] - 1);
sum -= L - sumFenwick(prefix, a[R]);
sst.add(a[R]+1, n+1, -1);
}
while(L > ql){
L--;
addFenwick(prefix, a[L], -1);
sum -= L - sumFenwick(prefix, a[L]);
sum -= sumFenwick(suffix, a[L]-1);
sst.add(1, a[L], -1);
}
while(R > qr){
sum += sumFenwick(suffix, a[R] - 1);
sum += L - sumFenwick(prefix, a[R]);
addFenwick(suffix, a[R], 1);
sst.add(a[R]+1, n+1, 1);
R--;
}
while(L < ql){
sum += L - sumFenwick(prefix, a[L]);
sum += sumFenwick(suffix, a[L]-1);
addFenwick(prefix, a[L], 1);
sst.add(1, a[L], 1);
L++;
}
rets[ind] = sst.min(1, n+1) * (R-L+1) + sum;
}
for(long ret : rets){
out.println(ret);
}
}
public static class StarrySkyTreeL {
public final int M, H, N, LH;
public long[] mins;
public long[] plus;
public static final long I = Long.MAX_VALUE/4; // I+plus<long
public StarrySkyTreeL(int n)
{
N = n;
M = Integer.highestOneBit(Math.max(n-1, 1))<<2;
H = M>>>1;
LH = Integer.numberOfTrailingZeros(H);
mins = new long[M];
plus = new long[H];
}
public StarrySkyTreeL(long[] a)
{
this(a.length);
for(int i = 0;i < N;i++){
mins[H+i] = a[i];
}
Arrays.fill(mins, H+N, M, I);
for(int i = H-1;i >= 1;i--)propagate(i);
}
private void push1(int cur)
{
if(plus[cur] == 0)return;
int L = cur*2, R = L + 1;
mins[L] += plus[cur];
mins[R] += plus[cur];
if(L < H){
plus[L] += plus[cur];
plus[R] += plus[cur];
}
plus[cur] = 0;
}
private void propagate(int i)
{
mins[i] = Math.min(mins[2*i], mins[2*i+1]) + plus[i];
}
private void add1(int cur, long v)
{
mins[cur] += v;
if(cur < H){
plus[cur] += v;
}
}
private void push(int l, int r)
{
for(int i = LH;i >= 1;i--) {
if (l >>> i << i != l) push1(l >>> i);
if (r >>> i << i != r) push1(r >>> i);
}
}
public void add(int l, int r, long v)
{
if(l >= r)return;
l += H; r += H;
push(l, r);
for(int ll = l, rr = r;ll < rr;ll>>>=1,rr>>>=1){
if((ll&1) == 1) add1(ll++, v);
if((rr&1) == 1) add1(--rr, v);
}
for(int i = 1;i <= LH;i++){
if(l>>>i<<i != l)propagate(l>>>i);
if(r>>>i<<i != r)propagate(r>>>i);
}
}
public long min(int l, int r){
long min = I;
if(l >= r)return min;
l += H; r += H;
push(l, r);
for(;l < r;l>>>=1,r>>>=1){
if((l&1) == 1)min = Math.min(min, mins[l++]);
if((r&1) == 1)min = Math.min(min, mins[--r]);
}
return min;
}
public int firstle(int l, long v) {
if(l >= H)return -1;
int cur = H+l;
for(int i = 1, j = Integer.numberOfTrailingZeros(H)-1;i <= cur;j--){
push1(i);
i = i*2|cur>>>j&1;
}
while(true){
push1(cur);
if(mins[cur] <= v){
if(cur >= H)return cur-H;
cur = 2*cur;
}else{
cur++;
if((cur&cur-1) == 0)return -1;
cur = cur>>>Integer.numberOfTrailingZeros(cur);
}
}
}
public int lastle(int l, long v) {
if(l < 0)return -1;
int cur = H+l;
for(int i = 1, j = Integer.numberOfTrailingZeros(H)-1;i <= cur;j--){
push1(i);
i = i*2|cur>>>j&1;
}
while(true){
push1(cur);
if(mins[cur] <= v){
if(cur >= H)return cur-H;
cur = 2*cur+1;
}else{
if((cur&cur-1) == 0)return -1;
cur = cur>>>Integer.numberOfTrailingZeros(cur);
cur--;
}
}
}
public long[] toArray() { return toArray(1, 0, H, new long[H]); }
private long[] toArray(int cur, int l, int r, long[] ret)
{
if(r-l == 1){
ret[cur-H] = mins[cur];
}else{
toArray(2*cur, l, l+r>>>1, ret);
toArray(2*cur+1, l+r>>>1, r, ret);
for(int i = l;i < r;i++)ret[i] += plus[cur];
}
return ret;
}
}
public static int sumFenwick(int[] ft, int i)
{
int sum = 0;
for(i++;i > 0;i -= i&-i)sum += ft[i];
return sum;
}
public static void addFenwick(int[] ft, int l, int r, int v)
{
addFenwick(ft, l, v);
addFenwick(ft, r, -v);
}
public static void addFenwick(int[] ft, int i, int v)
{
if(v == 0 || i < 0)return;
int n = ft.length;
for(i++;i < n;i += i&-i)ft[i] += v;
}
public static long[] sqrtSort(int[][] qs, int n)
{
int m = qs.length;
long[] pack = new long[m];
int S = (int)Math.sqrt(n);
for(int i = 0;i < m;i++){
pack[i] = (long)qs[i][0]/S<<50|(long)((qs[i][0]/S&1)==0?qs[i][1]:(1<<25)-1-qs[i][1])<<25|i;
}
Arrays.sort(pack);
return pack;
}
public static void main(String[] args) {
new G().run();
}
public void run()
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new FastWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-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();
}
private boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
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 long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
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();
}
}
public static class FastWriter
{
private static final int BUF_SIZE = 1<<13;
private final byte[] buf = new byte[BUF_SIZE];
private final OutputStream out;
private int ptr = 0;
private FastWriter(){out = null;}
public FastWriter(OutputStream os)
{
this.out = os;
}
public FastWriter(String path)
{
try {
this.out = new FileOutputStream(path);
} catch (FileNotFoundException e) {
throw new RuntimeException("FastWriter");
}
}
public FastWriter write(byte b)
{
buf[ptr++] = b;
if(ptr == BUF_SIZE)innerflush();
return this;
}
public FastWriter write(char c)
{
return write((byte)c);
}
public FastWriter write(char[] s)
{
for(char c : s){
buf[ptr++] = (byte)c;
if(ptr == BUF_SIZE)innerflush();
}
return this;
}
public FastWriter write(String s)
{
s.chars().forEach(c -> {
buf[ptr++] = (byte)c;
if(ptr == BUF_SIZE)innerflush();
});
return this;
}
private static int countDigits(int l) {
if (l >= 1000000000) return 10;
if (l >= 100000000) return 9;
if (l >= 10000000) return 8;
if (l >= 1000000) return 7;
if (l >= 100000) return 6;
if (l >= 10000) return 5;
if (l >= 1000) return 4;
if (l >= 100) return 3;
if (l >= 10) return 2;
return 1;
}
public FastWriter write(int x)
{
if(x == Integer.MIN_VALUE){
return write((long)x);
}
if(ptr + 12 >= BUF_SIZE)innerflush();
if(x < 0){
write((byte)'-');
x = -x;
}
int d = countDigits(x);
for(int i = ptr + d - 1;i >= ptr;i--){
buf[i] = (byte)('0'+x%10);
x /= 10;
}
ptr += d;
return this;
}
private static int countDigits(long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
public FastWriter write(long x)
{
if(x == Long.MIN_VALUE){
return write("" + x);
}
if(ptr + 21 >= BUF_SIZE)innerflush();
if(x < 0){
write((byte)'-');
x = -x;
}
int d = countDigits(x);
for(int i = ptr + d - 1;i >= ptr;i--){
buf[i] = (byte)('0'+x%10);
x /= 10;
}
ptr += d;
return this;
}
public FastWriter write(double x, int precision)
{
if(x < 0){
write('-');
x = -x;
}
x += Math.pow(10, -precision)/2;
// if(x < 0){ x = 0; }
write((long)x).write(".");
x -= (long)x;
for(int i = 0;i < precision;i++){
x *= 10;
write((char)('0'+(int)x));
x -= (int)x;
}
return this;
}
public FastWriter writeln(char c){
return write(c).writeln();
}
public FastWriter writeln(int x){
return write(x).writeln();
}
public FastWriter writeln(long x){
return write(x).writeln();
}
public FastWriter writeln(double x, int precision){
return write(x, precision).writeln();
}
public FastWriter write(int... xs)
{
boolean first = true;
for(int x : xs) {
if (!first) write(' ');
first = false;
write(x);
}
return this;
}
public FastWriter write(long... xs)
{
boolean first = true;
for(long x : xs) {
if (!first) write(' ');
first = false;
write(x);
}
return this;
}
public FastWriter writeln()
{
return write((byte)'\n');
}
public FastWriter writeln(int... xs)
{
return write(xs).writeln();
}
public FastWriter writeln(long... xs)
{
return write(xs).writeln();
}
public FastWriter writeln(char[] line)
{
return write(line).writeln();
}
public FastWriter writeln(char[]... map)
{
for(char[] line : map)write(line).writeln();
return this;
}
public FastWriter writeln(String s)
{
return write(s).writeln();
}
private void innerflush()
{
try {
out.write(buf, 0, ptr);
ptr = 0;
} catch (IOException e) {
throw new RuntimeException("innerflush");
}
}
public void flush()
{
innerflush();
try {
out.flush();
} catch (IOException e) {
throw new RuntimeException("flush");
}
}
public FastWriter print(byte b) { return write(b); }
public FastWriter print(char c) { return write(c); }
public FastWriter print(char[] s) { return write(s); }
public FastWriter print(String s) { return write(s); }
public FastWriter print(int x) { return write(x); }
public FastWriter print(long x) { return write(x); }
public FastWriter print(double x, int precision) { return write(x, precision); }
public FastWriter println(char c){ return writeln(c); }
public FastWriter println(int x){ return writeln(x); }
public FastWriter println(long x){ return writeln(x); }
public FastWriter println(double x, int precision){ return writeln(x, precision); }
public FastWriter print(int... xs) { return write(xs); }
public FastWriter print(long... xs) { return write(xs); }
public FastWriter println(int... xs) { return writeln(xs); }
public FastWriter println(long... xs) { return writeln(xs); }
public FastWriter println(char[] line) { return writeln(line); }
public FastWriter println(char[]... map) { return writeln(map); }
public FastWriter println(String s) { return writeln(s); }
public FastWriter println() { return writeln(); }
}
public static void trnz(int... o)
{
for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
System.out.println();
}
// print ids which are 1
public static void trt(long... o)
{
Queue<Integer> stands = new ArrayDeque<>();
for(int i = 0;i < o.length;i++){
for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
}
System.out.println(stands);
}
public static void tf(boolean... r)
{
for(boolean x : r)System.out.print(x?'#':'.');
System.out.println();
}
public static void tf(boolean[]... b)
{
for(boolean[] r : b) {
for(boolean x : r)System.out.print(x?'#':'.');
System.out.println();
}
System.out.println();
}
public void tf(long[]... b)
{
if(INPUT.length() != 0) {
for (long[] r : b) {
for (long x : r) {
for (int i = 0; i < 64; i++) {
System.out.print(x << ~i < 0 ? '#' : '.');
}
}
System.out.println();
}
System.out.println();
}
}
public void tf(long... b)
{
if(INPUT.length() != 0) {
for (long x : b) {
for (int i = 0; i < 64; i++) {
System.out.print(x << ~i < 0 ? '#' : '.');
}
}
System.out.println();
}
}
private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}