Submission #524247
Source Code Expand
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#include<climits>
#include<algorithm>
#include<vector>
#include<valarray>
#include<string>
#include<set>
#include<map>
#include<stack>
#include<queue>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define DREP(i,n) for(int i=n;i>0;i--)
#define Rep(i,m,n) for(int i=m;i<n;i++)
#define scani(a) scanf("%d",&a)
#define scand(a) scanf("%lf",&a)
#define scans(s) scanf("%s",s)
#define readi(a) int a;scanf("%d",&a)
#define printi(a) printf("%d",a)
#define prints(s) printf("%s",s)
#define even(n) (((n)+1)%2)
#define odd(n) ((n)%2)
#define sg(x) ((x)?1:0)
#define LF printf("\n")
#define SPACE printf(" ")
#define pb push_back
#define mp make_pair
#define bs binary_search
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long LL;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<double,double> pdd;
typedef pair<int,int> pii;
const double pi=acos(-1.0);
double rad(double t){return t*pi/180.0;}
double deg(double d){return d*180.0/pi;}
int GCD(int x,int y){if(x<y)swap(x,y);return x%y?GCD(y,x%y):y;}
int LCM(int x,int y){return x/GCD(x,y)*y;}
int main(){
readi(n);readi(m);
int num[300009]={},ans=0;
int s[100009],t[100009];
REP(i,m){
scanf("%d%d",&s[i],&t[i]);
num[s[i]]++;
num[t[i]+1]--;
}
//ruisekiwa
REP(i,n+1)num[i]+=num[i-1];
//vector wo tsukuru
vi ng;
REP(i,n)if(num[i]==1)ng.pb(i);
//check
REP(i,n)// printf("%d ",num[i]),
num[i]=0;
REP(i,m)if(lower_bound(all(ng),s[i])==upper_bound(all(ng),t[i])){
num[i]=1;
ans++;
}
printf("%d\n",ans);
REP(i,m)if(num[i])printf("%d\n",i);
return 0;
}
Submission Info
| Submission Time |
|
| Task |
B - ドキドキデート大作戦高橋君 |
| User |
buko1062000 |
| Language |
C++ (GCC 4.9.2) |
| Score |
100 |
| Code Size |
1844 Byte |
| Status |
AC |
| Exec Time |
123 ms |
| Memory |
4888 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:52:11: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
readi(n);readi(m);
^
./Main.cpp:52:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
readi(n);readi(m);
^
./Main.cpp:56:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&s[i],&t[i]);
^
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 |
27 ms |
1944 KiB |
| subtask0_sample_02.txt |
AC |
27 ms |
1944 KiB |
| subtask0_sample_03.txt |
AC |
26 ms |
2084 KiB |
| subtask1_01.txt |
AC |
88 ms |
4888 KiB |
| subtask1_02.txt |
AC |
111 ms |
2720 KiB |
| subtask1_03.txt |
AC |
81 ms |
3284 KiB |
| subtask1_04.txt |
AC |
123 ms |
3364 KiB |
| subtask1_05.txt |
AC |
121 ms |
3360 KiB |
| subtask1_06.txt |
AC |
28 ms |
1964 KiB |
| subtask1_07.txt |
AC |
27 ms |
1956 KiB |
| subtask1_08.txt |
AC |
26 ms |
1948 KiB |
| subtask1_09.txt |
AC |
26 ms |
1960 KiB |
| subtask2_01.txt |
AC |
107 ms |
2728 KiB |
| subtask2_02.txt |
AC |
112 ms |
2724 KiB |
| subtask2_03.txt |
AC |
28 ms |
1948 KiB |
| subtask2_04.txt |
AC |
28 ms |
1880 KiB |
| subtask2_05.txt |
AC |
27 ms |
2072 KiB |
| subtask2_06.txt |
AC |
27 ms |
2072 KiB |
| subtask2_07.txt |
AC |
27 ms |
1952 KiB |
| subtask2_08.txt |
AC |
114 ms |
2720 KiB |