Submission #3963400
Source Code Expand
#include <bits/stdc++.h>
#define rep(i, m, n) for(int i = m; i < (n); i++)
#define rrep(i,m,n) for(int i = m; i >= n; i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(int i = 0; i < n; i++){ cout << (x[i]) << " ";} cout << endl;
#define printa2(x,m,n) for(int i = 0; i < m; i++){ for(int j = 0; j < n; j++){ cout << x[i][j] << " ";} cout << endl;}
#define printp(x,n) for(int i = 0; i < n; i++){ cout << "(" << x[i].first << ", " << x[i].second << ") "; } cout << endl;
#define INF (1e18)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
typedef struct{
ll to;
ll cost;
} edge;
typedef pair<ll, ll> lpair;
typedef struct {
ll s;
ll t;
ll idx;
} pp;
ll N,M;
ll s[100010], t[100010];
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N >> M;
rep(i,0,M){
cin >> s[i] >> t[i];
s[i]--; t[i]--;
}
ll cnt[300010] = {};
rep(i,0,M){
cnt[s[i]]++;
cnt[t[i]+1]--;
}
rep(i,0,N+1){
cnt[i+1] += cnt[i];
}
ll sum[300010] = {};
rep(i,0,N){
if(cnt[i] == 1){
sum[i+1] = sum[i] + 1;
}else{
sum[i+1] = sum[i];
}
}
ll ans_cnt = 0;
vector<ll> pos;
rep(i,0,M){
if(sum[t[i]+1] - sum[s[i]] == 0){
ans_cnt++;
pos.push_back(i);
}
}
print(ans_cnt);
rep(i,0,ans_cnt){
print(pos[i]+1);
}
}
Submission Info
Submission Time |
|
Task |
B - ドキドキデート大作戦高橋君 |
User |
yuji9511 |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1559 Byte |
Status |
AC |
Exec Time |
181 ms |
Memory |
8052 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 |
3 ms |
4992 KB |
subtask0_sample_02.txt |
AC |
3 ms |
4992 KB |
subtask0_sample_03.txt |
AC |
3 ms |
4992 KB |
subtask1_01.txt |
AC |
20 ms |
6528 KB |
subtask1_02.txt |
AC |
178 ms |
8052 KB |
subtask1_03.txt |
AC |
19 ms |
6528 KB |
subtask1_04.txt |
AC |
101 ms |
7288 KB |
subtask1_05.txt |
AC |
102 ms |
7288 KB |
subtask1_06.txt |
AC |
3 ms |
4992 KB |
subtask1_07.txt |
AC |
3 ms |
4992 KB |
subtask1_08.txt |
AC |
3 ms |
4992 KB |
subtask1_09.txt |
AC |
3 ms |
4992 KB |
subtask2_01.txt |
AC |
169 ms |
8052 KB |
subtask2_02.txt |
AC |
171 ms |
8052 KB |
subtask2_03.txt |
AC |
3 ms |
4992 KB |
subtask2_04.txt |
AC |
3 ms |
4992 KB |
subtask2_05.txt |
AC |
3 ms |
4992 KB |
subtask2_06.txt |
AC |
3 ms |
4992 KB |
subtask2_07.txt |
AC |
3 ms |
4992 KB |
subtask2_08.txt |
AC |
181 ms |
8052 KB |