Submission #1502036
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i, n) for(int i = 0; i < (n); i++) #define MEM(a, x) memset(a, x, sizeof(a)) #define ALL(a) a.begin(), a.end() #define UNIQUE(a) a.erase(unique(ALL(a)), a.end()) typedef long long ll; int n, m; int imos[300005], s[100005], t[100005]; int main(int argc, char const *argv[]) { ios_base::sync_with_stdio(false); cin >> n >> m; FOR(i, m) { cin >> s[i] >> t[i]; imos[s[i]]++; imos[t[i]+1]--; } FOR(i, n+1) imos[i+1] += imos[i]; FOR(i, n+2) imos[i] = imos[i] == 1 ? 1 : 0; FOR(i, n+1) imos[i+1] += imos[i]; vector<int> ret; FOR(i, m) { if (imos[s[i]] == imos[t[i]]) ret.push_back(i+1); } cout << ret.size() << endl; FOR(i, ret.size()) cout << ret[i] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ドキドキデート大作戦高橋君 |
User | moguta |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 780 Byte |
Status | WA |
Exec Time | 168 ms |
Memory | 3320 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 | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | WA | 1 ms | 256 KB |
subtask1_01.txt | AC | 19 ms | 2176 KB |
subtask1_02.txt | AC | 168 ms | 3320 KB |
subtask1_03.txt | WA | 91 ms | 2428 KB |
subtask1_04.txt | WA | 101 ms | 2300 KB |
subtask1_05.txt | WA | 102 ms | 2300 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | WA | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask2_01.txt | AC | 162 ms | 3320 KB |
subtask2_02.txt | AC | 163 ms | 3320 KB |
subtask2_03.txt | WA | 1 ms | 256 KB |
subtask2_04.txt | WA | 1 ms | 256 KB |
subtask2_05.txt | WA | 1 ms | 256 KB |
subtask2_06.txt | WA | 1 ms | 256 KB |
subtask2_07.txt | WA | 1 ms | 256 KB |
subtask2_08.txt | WA | 167 ms | 2936 KB |