結果
| 問題 | No.945 YKC饅頭 |
| ユーザー |
 Oland
|
| 提出日時 | 2019-12-08 00:14:29 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 402 ms / 2,000 ms |
| コード長 | 8,941 bytes |
| コンパイル時間 | 3,438 ms |
| コンパイル使用メモリ | 82,616 KB |
| 実行使用メモリ | 55,856 KB |
| 最終ジャッジ日時 | 2024-12-26 18:51:11 |
| 合計ジャッジ時間 | 18,671 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 74 |
ソースコード
import java.io.*;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
FastScanner in;
PrintWriter out;
int MOD = (int)1e9+7;
long ceil(long a, long b){return (a + b - 1) / b;}
long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
long lcm(long a, long b){return a / gcd(a, b) * b;}
void solve() {
int n = in.nextInt(), m = in.nextInt();
DualSegmentTreeUpdate seg = new DualSegmentTreeUpdate(n, 0);
int[] L = new int[m], R = new int[m], T = new int[m];
for(int i = 0; i < m; i++){
L[i] = in.nextInt()-1;
R[i] = in.nextInt();
char t = in.nextChar();
if(t == 'Y') T[i] = 1;
if(t == 'K') T[i] = 2;
if(t == 'C') T[i] = 3;
}
for(int i = m-1; i >= 0; i--){
seg.setSegment(L[i], R[i], T[i]);
}
int[] num = new int[4];
for(int i = 0; i < n; i++) num[(int)seg.getPoint(i)]++;
for(int i = 1; i <= 3; i++) out.print(num[i] + " ");
out.println();
}
class DualSegmentTreeUpdate {
//0-indexed
int d;
long[] node;
int[] stamp;
int count;
/* 単位元で初期化 */
public DualSegmentTreeUpdate(int sz, long initVal){
long[] v = new long[sz];
Arrays.fill(v, initVal);
init(v);
}
/* 配列vで初期化 */
public DualSegmentTreeUpdate(long[] v){
init(v);
}
private void init(long[] v){
d = 1;
while(d < v.length) d *= 2;
node = new long[2*d];
stamp = new int[2*d];
count = 0;
for(int i = 0; i < v.length; i++)
node[i+d] = v[i];
}
/* xの要素を取得する */
public long getPoint(int x){
x += d;
long res = node[x];
int maxCount = stamp[x];
while(x > 1){
x = x / 2;
if(maxCount < stamp[x]){
maxCount = stamp[x];
res = node[x];
}
}
return res;
}
/* 指定した区間[a,b)に含まれるすべての要素を更新するクエリ */
public void setSegment(int L, int R, long val){
count++;//時間を更新
L += d;
R += d;
while (L < R) {
if ((L & 1) != 0){
node[L] = val;
stamp[L] = count;//タイムスタンプ
L++;
}
if ((R & 1) != 0){
--R;
node[R] = val;
stamp[R] = count;//タイムスタンプ
}
L >>= 1;
R >>= 1;
}
}
}
public static void main(String[] args) {
new Main().m();
}
private void m() {
in = new FastScanner(System.in);
out = new PrintWriter(System.out);
/*
try {
String path = "output.txt";
out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
}catch (IOException e){
e.printStackTrace();
}
*/
solve();
out.flush();
in.close();
out.close();
}
static class FastScanner {
private Reader input;
public FastScanner() {this(System.in);}
public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
public void close() {
try {
this.input.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public int nextInt() {return (int) nextLong();}
public long nextLong() {
try {
int sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
long ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) return ret * sign;
ret *= 10;
ret += b - '0';
}
} catch (IOException e) {
e.printStackTrace();
return -1;
}
}
public double nextDouble() {
try {
double sign = 1;
int b = input.read();
while ((b < '0' || '9' < b) && b != '-' && b != '+') {
b = input.read();
}
if (b == '-') {
sign = -1;
b = input.read();
} else if (b == '+') {
b = input.read();
}
double ret = b - '0';
while (true) {
b = input.read();
if (b < '0' || '9' < b) break;
ret *= 10;
ret += b - '0';
}
if (b != '.') return sign * ret;
double div = 1;
b = input.read();
while ('0' <= b && b <= '9') {
ret *= 10;
ret += b - '0';
div *= 10;
b = input.read();
}
return sign * ret / div;
} catch (IOException e) {
e.printStackTrace();
return Double.NaN;
}
}
public char nextChar() {
try {
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
return (char) b;
} catch (IOException e) {
e.printStackTrace();
return 0;
}
}
public String nextStr() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (Character.isWhitespace(b)) {
b = input.read();
}
while (b != -1 && !Character.isWhitespace(b)) {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public String nextLine() {
try {
StringBuilder sb = new StringBuilder();
int b = input.read();
while (b != -1 && b != '\n') {
sb.append((char) b);
b = input.read();
}
return sb.toString();
} catch (IOException e) {
e.printStackTrace();
return "";
}
}
public int[] nextIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public int[] nextIntArrayDec(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt() - 1;
}
return res;
}
public int[] nextIntArray1Index(int n) {
int[] res = new int[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextInt();
}
return res;
}
public long[] nextLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public long[] nextLongArrayDec(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong() - 1;
}
return res;
}
public long[] nextLongArray1Index(int n) {
long[] res = new long[n + 1];
for (int i = 0; i < n; i++) {
res[i + 1] = nextLong();
}
return res;
}
public double[] nextDoubleArray(int n) {
double[] res = new double[n];
for (int i = 0; i < n; i++) {
res[i] = nextDouble();
}
return res;
}
}
}