Submission #1245539
Source Code Expand
#include<bits/stdc++.h> using namespace std; int main() { cin.sync_with_stdio(false); int N, M; cin >> N >> M; vector<int>n(N+1); vector<int>s(M); vector<int>t(M); vector<int>sum(N + 1); for (int i = 0;i < M;i++) { cin >> s[i] >> t[i]; n[s[i]]++; if (t[i] < N) { n[t[i] + 1]--; } } for (int i = 1;i <= N;i++) { n[i] += n[i-1]; if (n[i] == 1) { sum[i]++; } } for (int i = 1;i <= N;i++) { sum[i] += sum[i-1]; } vector<int>sabo; bool flag; for (int i = 0;i < M;i++) { if (sum[t[i]] - sum[s[i]-1] == 0) { sabo.push_back(i+1); } } cout << sabo.size() << endl; for (int i = 0;i < sabo.size();i++) { cout << sabo[i] << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ドキドキデート大作戦高橋君 |
User | agis |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 735 Byte |
Status | AC |
Exec Time | 167 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 | 21 ms | 3328 KB |
subtask1_02.txt | AC | 164 ms | 4472 KB |
subtask1_03.txt | AC | 20 ms | 2560 KB |
subtask1_04.txt | AC | 97 ms | 2812 KB |
subtask1_05.txt | AC | 99 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 | 164 ms | 4472 KB |
subtask2_02.txt | AC | 167 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 | 166 ms | 3704 KB |