Submission #1245305
Source Code Expand
#include<bits/stdc++.h> using namespace std; int main() { int N, M; cin >> N >> M; vector<int>n(N+1); vector<int>s(M); vector<int>t(M); vector<int>only; for (int i = 0;i < M;i++) { cin >> s[i] >> t[i]; n[s[i]-1]++; n[t[i]]--; } for (int i = 0;i < N;i++) { if (i) { n[i] += n[i - 1]; } if (n[i] < 2) { only.push_back(i); } } vector<int>sabo; bool flag; for (int i = 0;i < M;i++) { flag = true; for (int j = 0;j < only.size();j++) { if (s[i] - 1 <= only[j] && only[j] <= t[i] - 1) { flag = false; break; } } if (flag) { 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 | 0 |
Code Size | 764 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 4340 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | 6 ms | 764 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | TLE | 2103 ms | 4340 KB |
subtask1_02.txt | AC | 214 ms | 3320 KB |
subtask1_03.txt | TLE | 2103 ms | 2428 KB |
subtask1_04.txt | TLE | 2103 ms | 2300 KB |
subtask1_05.txt | TLE | 2103 ms | 2300 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 | 200 ms | 3320 KB |
subtask2_02.txt | AC | 209 ms | 3320 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 | 217 ms | 2936 KB |