Submission #1817860
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>bool chmin(T&a,const T&b){return a>b?(a=b,1):0;}
template<class T>bool chmax(T&a,const T&b){return a<b?(a=b,1):0;}
int nextInt() { int x; scanf("%d", &x); return x;}
const int MAX_M = 300005;
const int MAX_N = 100005;
int acc[MAX_N];
ll ex[MAX_N];
bool ok[MAX_M];
int main2() {
memset(acc, 0, sizeof(acc));
memset(ex, 0, sizeof(ex));
int N = nextInt();
int M = nextInt();
REP(i, M) {
int A = nextInt() - 1;
int B = nextInt();
acc[A]++;
acc[B]--;
ex[A] += (i+1);
ex[B] -= (i+1);
}
REP(i, N) acc[i+1] += acc[i];
REP(i, N) ex[i+1] += ex[i];
REP(i, M) ok[i] = true;
REP(i, N) if (acc[i] == 1) {
ok[ex[i]-1] = false;
}
int size = 0;
REP(i, M) if (ok[i]) size++;
printf("%d\n", size);
REP(i, M) if (ok[i]) printf("%d\n", i+1);
return 0;
}
int main() {
for (;!cin.eof();cin>>ws) main2();
return 0;
}
Submission Info
Submission Time
2017-11-30 17:22:10+0900
Task
B - ドキドキデート大作戦高橋君
User
hs484
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1305 Byte
Status
RE
Exec Time
783 ms
Memory
1408 KB
Compile Error
./Main.cpp: In function ‘int nextInt()’:
./Main.cpp:12:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int nextInt() { int x; scanf("%d", &x); return x;}
^
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
2 ms
1408 KB
subtask0_sample_02.txt
AC
2 ms
1408 KB
subtask0_sample_03.txt
AC
2 ms
1408 KB
subtask1_01.txt
RE
783 ms
1408 KB
subtask1_02.txt
RE
104 ms
1408 KB
subtask1_03.txt
RE
102 ms
1408 KB
subtask1_04.txt
RE
99 ms
1408 KB
subtask1_05.txt
RE
99 ms
1408 KB
subtask1_06.txt
AC
2 ms
1408 KB
subtask1_07.txt
AC
2 ms
1408 KB
subtask1_08.txt
AC
2 ms
1408 KB
subtask1_09.txt
AC
2 ms
1408 KB
subtask2_01.txt
RE
99 ms
1408 KB
subtask2_02.txt
RE
102 ms
1408 KB
subtask2_03.txt
AC
2 ms
1408 KB
subtask2_04.txt
AC
2 ms
1408 KB
subtask2_05.txt
AC
2 ms
1408 KB
subtask2_06.txt
AC
2 ms
1408 KB
subtask2_07.txt
AC
2 ms
1408 KB
subtask2_08.txt
RE
99 ms
1408 KB