Submission #1245483
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main() { int N, M; cin >> N >> M; vector<int> s(M), t(M), sum(N + 1), imos(N + 1); for (int i = 0; i < M; i++) { cin >> s[i] >> t[i]; sum[s[i]]++; if (t[i] < N) { sum[t[i] + 1]--; } } for (int i = 1; i <= N; i++) { sum[i] += sum[i - 1]; if (sum[i] == 1) { imos[i]++; } } for (int i = 1; i <= N; i++) { imos[i] += imos[i - 1]; } vector<int> res; for (int i = 0; i < M; i++) { if (imos[t[i]] == imos[s[i] - 1]) { res.push_back(i + 1); } } cout << res.size() << endl; for (auto ans : res) { cout << ans << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ドキドキデート大作戦高橋君 |
User | kazuma |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 657 Byte |
Status | AC |
Exec Time | 220 ms |
Memory | 4472 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 64 ms | 3328 KB |
subtask1_02.txt | AC | 220 ms | 4472 KB |
subtask1_03.txt | AC | 62 ms | 2560 KB |
subtask1_04.txt | AC | 145 ms | 2812 KB |
subtask1_05.txt | AC | 150 ms | 2812 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask2_01.txt | AC | 207 ms | 4472 KB |
subtask2_02.txt | AC | 217 ms | 4472 KB |
subtask2_03.txt | AC | 1 ms | 256 KB |
subtask2_04.txt | AC | 1 ms | 256 KB |
subtask2_05.txt | AC | 1 ms | 256 KB |
subtask2_06.txt | AC | 1 ms | 256 KB |
subtask2_07.txt | AC | 1 ms | 256 KB |
subtask2_08.txt | AC | 216 ms | 3704 KB |