結果
| 問題 |
No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
|
| コンテスト | |
| ユーザー |
 ぴろず
|
| 提出日時 | 2015-06-20 00:53:13 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,331 bytes |
| コンパイル時間 | 2,047 ms |
| コンパイル使用メモリ | 86,800 KB |
| 実行使用メモリ | 54,540 KB |
| 最終ジャッジ日時 | 2024-07-07 04:31:05 |
| 合計ジャッジ時間 | 7,077 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 15 WA * 2 |
ソースコード
package no230;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
IO io = new IO();
int n = io.nextInt();
int q = io.nextInt();
RangeSetRangeSum teamA = new RangeSetRangeSum(n);
RangeSetRangeSum teamB = new RangeSetRangeSum(n);
int scoreA = 0,scoreB = 0;
// System.out.println("----");
// System.out.println(teamA);
// System.out.println(teamB);
for(int i=0;i<q;i++) {
int x = io.nextInt();
int l = io.nextInt();
int r = io.nextInt();
if (x == 0) {
int a = teamA.sum(l, r);
int b = teamB.sum(l, r);
// System.out.println(a + " - " + b);
if (a > b) {
scoreA += a;
}else if(a < b) {
scoreB += b;
}
}else if(x == 1) {
teamA.set(l, r, 1);
teamB.set(l, r, 0);
}else{
teamA.set(l, r, 0);
teamB.set(l, r, 1);
}
// System.out.println("----");
// System.out.println(teamA);
// System.out.println(teamB);
}
scoreA += teamA.sum(0, n-1);
scoreB += teamB.sum(0, n-1);
System.out.println(scoreA + " " + scoreB);
}
}
class RangeSetRangeSum {
int n;
boolean[] block;
int[] bdata;
int[] data;
int[] sum;
int sqrtn;
public RangeSetRangeSum(int size) {
int sqrtfloor = (int) Math.sqrt(size);
sqrtn = sqrtfloor + (sqrtfloor * sqrtfloor < size ? 1 : 0);
n = sqrtn * sqrtn;
block = new boolean[sqrtn];
bdata = new int[sqrtn];
data = new int[n];
sum = new int[sqrtn];
}
public void set(int first,int last,int x) {
for(int i=0;i<sqrtn;i++) {
int bf = i * sqrtn;
int bl = (i + 1) * sqrtn - 1;
if (bl < first || last < bf) {
continue;
}
if (first <= bf && bl <= last) {
block[i] = true;
bdata[i] = x;
sum[i] = x * sqrtn;
}else{
sum[i] = 0;
for(int j=bf;j<=bl;j++) {
if (first <= j && j <= last) {
data[j] = x;
}else if (block[i]){
data[j] = bdata[i];
}
sum[i] += data[j];
}
block[i] = false;
}
}
}
public int sum(int first,int last) {
int ret = 0;
for(int i=0;i<sqrtn;i++) {
int bf = i * sqrtn;
int bl = (i + 1) * sqrtn - 1;
if (bl < first || last < bf) {
continue;
}
if (first <= bf && bl <= last) {
ret += sum[i];
}else{
if (block[i]) {
ret += (Math.min(bl, last) - Math.max(bf, first) + 1) * bdata[i];
}else{
int j0 = Math.max(bf, first);
int j1 = Math.min(bl, last);
for(int j=j0;j<=j1;j++) {
ret += data[j];
}
}
}
}
return ret;
}
public String toString() {
int[] d = new int[n];
for(int i=0;i<n;i++) {
d[i] = block[i / sqrtn] ? bdata[i / sqrtn] : data[i];
}
return Arrays.toString(d) + "," + Arrays.toString(sum) + "," + Arrays.toString(block);
}
}
class IO extends PrintWriter {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public IO() { this(System.in);}
public IO(InputStream source) { super(System.out); this.in = source;}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public char[] nextCharArray(int len) {
if (!hasNext()) {
throw new NoSuchElementException();
}
char[] s = new char[len];
int i = 0;
int b = readByte();
while(isPrintableChar(b)) {
if (i == len) {
throw new InputMismatchException();
}
s[i++] = (char) b;
b = readByte();
}
return s;
}
public String nextLine() {
if (!hasNextLine()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
int b = readByte();
while(!isNewLine(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new NoSuchElementException();
}
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
throw new NumberFormatException();
}
return (int) nl;
}
public char nextChar() {
if (!hasNext()) {
throw new NoSuchElementException();
}
return (char) readByte();
}
public double nextDouble() { return Double.parseDouble(next());}
public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}