Submission #20607

ソースコード

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include "iostream"
#include "list"
#include "vector"
#include "set"
#include "unordered_map"
#include "queue";
using namespace std;
int main() {
int N, Q;
int query[300000] = {};
set<int>S;
unordered_map<int,int>m;
cin >> N >> Q;
for (int i = 0; i < Q; i++) {
int a;
cin >> a;
if (a == 1) {
int b, c;
cin >> b >> c;
S.insert(b);
query[i * 3] = 1;
query[i * 3 + 1] = b;
query[i * 3 + 2] = c;
}
else {
int b, c;
cin >> b >> c;
query[i * 3] = 2;
query[i * 3 + 1] = b;
query[i * 3 + 2] = c;
}
}
S.insert(-1);
vector<int>v(S.begin(), S.end());
for (int i = 0; i < v.size(); i++) {
m[v[i]] = i;
}
vector<vector<int>>sum(N + 1, vector<int>(v.size(), 0));
queue<int>QQ;
list<int>join[1001] = {};
for (int i = 0; i < Q; i++) {
int a, b, c;
a = query[i * 3];
b = query[i * 3 + 1];
c = query[i * 3 + 2];
if (a == 1) {
QQ.push(c);
join[c].push_back(b);
}
else {
while (!QQ.empty()) {
int current = QQ.front();
QQ.pop();
if (join[current].empty())continue;
join[current].sort();
int box = 0;
for (int j = 1; j < v.size(); j++) {
if (!join[current].empty()) {
if (*join[current].begin() == j)box++;
}
sum[current][j] += box;
}
}
int ans = 0;
for (int j = 1; j <= N; j++) {
if (sum[j][m[c]] - (sum[j][m[b] - 1]))ans++;
}
cout << ans << endl;
}
}
return 0;
}

ステータス

項目 データ
問題 0759 - ghoststudents2
ユーザー名 olphe
投稿日時 2017-07-05 02:26:54
言語 C++11
状態 Wrong Answer
得点 0
ソースコード長 1479 Byte
最大実行時間 1000 ms
最大メモリ使用量 200120 KB

セット

セット 得点 Cases
1 ALL 0 / 10 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
00_sample_01.in AC 15 ms 1632 KB
1
00_sample_02.in AC 11 ms 1544 KB
1
01_small_01.in AC 13 ms 1584 KB
1
01_small_02.in WA 20 ms 1624 KB
1
01_small_03.in AC 12 ms 1660 KB
1
01_small_04.in WA 13 ms 1700 KB
1
01_small_05.in WA 13 ms 1740 KB
1
01_small_06.in AC 13 ms 1780 KB
1
01_small_07.in AC 12 ms 1696 KB
1
01_small_08.in WA 17 ms 1612 KB
1
01_small_09.in AC 11 ms 1776 KB
1
01_small_10.in WA 13 ms 1816 KB
1
02_random_01.in WA 298 ms 29000 KB
1
02_random_02.in WA 275 ms 24764 KB
1
02_random_03.in WA 81 ms 9384 KB
1
02_random_04.in WA 395 ms 3520 KB
1
02_random_05.in WA 75 ms 11580 KB
1
02_random_06.in WA 100 ms 15904 KB
1
02_random_07.in WA 89 ms 9908 KB
1
02_random_08.in WA 157 ms 22136 KB
1
02_random_09.in WA 354 ms 34312 KB
1
02_random_10.in WA 109 ms 15224 KB
1
02_random_11.in WA 39 ms 3256 KB
1
02_random_12.in WA 114 ms 17268 KB
1
02_random_13.in WA 243 ms 27780 KB
1
02_random_14.in WA 156 ms 10500 KB
1
02_random_15.in WA 238 ms 8800 KB
1
02_random_16.in WA 164 ms 23820 KB
1
02_random_17.in WA 348 ms 44384 KB
1
02_random_18.in WA 183 ms 9884 KB
1
02_random_19.in WA 92 ms 15212 KB
1
02_random_20.in WA 154 ms 11564 KB
1
02_random_21.in WA 185 ms 16868 KB
1
02_random_22.in WA 102 ms 8476 KB
1
02_random_23.in WA 83 ms 13448 KB
1
02_random_24.in WA 269 ms 17024 KB
1
02_random_25.in WA 25 ms 3236 KB
1
02_random_26.in WA 185 ms 15240 KB
1
02_random_27.in WA 199 ms 26076 KB
1
02_random_28.in WA 450 ms 44136 KB
1
02_random_29.in WA 278 ms 14088 KB
1
02_random_30.in WA 280 ms 17752 KB
1
03_large_01.in TLE 1000 ms 199392 KB
1
03_large_02.in TLE 1000 ms 199540 KB
1
03_large_03.in TLE 1000 ms 198984 KB
1
03_large_04.in TLE 1000 ms 199788 KB
1
03_large_05.in TLE 1000 ms 199008 KB
1
03_large_06.in TLE 1000 ms 199844 KB
1
03_large_07.in TLE 1000 ms 199028 KB
1
03_large_08.in TLE 1000 ms 199920 KB
1
03_large_09.in TLE 1000 ms 199152 KB
1
03_large_10.in TLE 1000 ms 200120 KB
1