Submission #1734746
Source Code Expand
#include<stdio.h> #include<math.h> #include<algorithm> #include<queue> #include<deque> #include<string> #include<string.h> #include<vector> #include<set> #include<map> #include<stdlib.h> #include<cassert> using namespace std; const long long mod=1000000007; const long long inf=mod*mod; const long long d2=500000004; int p[110000]; int q[110000]; int r[110000]; int z[110000]; int x[110000]; int cnt[110000]; int val[110000]; vector<int>g[110000]; int ret[110000]; int main(){ int a; scanf("%d",&a); for(int i=0;i<a;i++){ scanf("%d%d",p+i,q+i); if(q[i]>p[i])q[i]=p[i]; } for(int i=0;i<=a;i++){ scanf("%d",r+i); z[i]=r[i]; } std::sort(z,z+a+1); for(int i=0;i<=a;i++){ cnt[lower_bound(z,z+a+1,r[i])-z]--; } for(int i=0;i<a;i++){ cnt[lower_bound(z,z+a+1,p[i])-z]++; g[lower_bound(z,z+a+1,q[i])-z].push_back(lower_bound(z,z+a+1,p[i])-z); } priority_queue<int>Q; int now=0; for(int i=0;i<=a;i++){ for(int j=0;j<g[i].size();j++){ Q.push(g[i][j]); } int to=a+1; while(Q.size()&&cnt[i]<0){ int at=Q.top();Q.pop(); if(at<=i)continue; to=at; now++; cnt[i]++; cnt[at]--; } x[i]=to; cnt[i+1]+=cnt[i]; } int ls=a; int rm=a; int len=0; for(int i=a;i>=0;i--){ if(cnt[i]<=-2){ rm=-1; }else if(cnt[i]==-1){ rm=min(i,rm); //ls=i; //len=0; ls=i; }else if(x[i]<=ls){ len++; ls=i; } ret[i]=len; } int c;scanf("%d",&c); for(int i=0;i<c;i++){ int s,t; scanf("%d%d",&s,&t); int ss=lower_bound(z,z+a+1,s)-z; int tt=lower_bound(z,z+a+1,t)-z; int ans=mod; if(rm>=ss)ans=min(ans,now-ret[ss]); if(rm>=tt)ans=min(ans,now-ret[tt]+1); // printf("%d %d: %d %d %d\n",ss,tt,now,ret[ss],ret[tt]); if(ans==mod)ans=-1; else ans=a+1-ans; printf("%d\n",ans); } }
Submission Info
Submission Time | |
---|---|
Task | F - Two Faced Cards |
User | tozangezan |
Language | C++14 (GCC 5.4.1) |
Score | 2000 |
Code Size | 1839 Byte |
Status | AC |
Exec Time | 164 ms |
Memory | 9728 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:28:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a); ^ ./Main.cpp:30:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",p+i,q+i); ^ ./Main.cpp:34:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",r+i); ^ ./Main.cpp:80:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int c;scanf("%d",&c); ^ ./Main.cpp:83:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&s,&t); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 2000 / 2000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt, subtask_1_42.txt, subtask_1_43.txt, subtask_1_44.txt, subtask_1_45.txt, subtask_1_46.txt, subtask_1_47.txt, subtask_1_48.txt, subtask_1_49.txt, subtask_1_50.txt, subtask_1_51.txt, subtask_1_52.txt, subtask_1_53.txt, subtask_1_54.txt, subtask_1_55.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 3 ms | 3968 KB |
sample_02.txt | AC | 3 ms | 3968 KB |
sample_03.txt | AC | 3 ms | 3968 KB |
subtask_1_01.txt | AC | 69 ms | 6656 KB |
subtask_1_02.txt | AC | 75 ms | 6912 KB |
subtask_1_03.txt | AC | 37 ms | 5376 KB |
subtask_1_04.txt | AC | 67 ms | 7424 KB |
subtask_1_05.txt | AC | 49 ms | 5248 KB |
subtask_1_06.txt | AC | 110 ms | 7808 KB |
subtask_1_07.txt | AC | 110 ms | 9088 KB |
subtask_1_08.txt | AC | 103 ms | 9088 KB |
subtask_1_09.txt | AC | 104 ms | 7676 KB |
subtask_1_10.txt | AC | 61 ms | 6784 KB |
subtask_1_11.txt | AC | 55 ms | 6528 KB |
subtask_1_12.txt | AC | 54 ms | 6400 KB |
subtask_1_13.txt | AC | 79 ms | 6396 KB |
subtask_1_14.txt | AC | 44 ms | 6016 KB |
subtask_1_15.txt | AC | 75 ms | 7808 KB |
subtask_1_16.txt | AC | 33 ms | 4992 KB |
subtask_1_17.txt | AC | 154 ms | 8952 KB |
subtask_1_18.txt | AC | 36 ms | 5888 KB |
subtask_1_19.txt | AC | 107 ms | 7168 KB |
subtask_1_20.txt | AC | 114 ms | 8960 KB |
subtask_1_21.txt | AC | 163 ms | 8952 KB |
subtask_1_22.txt | AC | 156 ms | 9728 KB |
subtask_1_23.txt | AC | 162 ms | 8952 KB |
subtask_1_24.txt | AC | 154 ms | 9728 KB |
subtask_1_25.txt | AC | 163 ms | 9080 KB |
subtask_1_26.txt | AC | 155 ms | 9728 KB |
subtask_1_27.txt | AC | 152 ms | 9472 KB |
subtask_1_28.txt | AC | 154 ms | 9728 KB |
subtask_1_29.txt | AC | 164 ms | 9080 KB |
subtask_1_30.txt | AC | 155 ms | 9600 KB |
subtask_1_31.txt | AC | 150 ms | 9472 KB |
subtask_1_32.txt | AC | 156 ms | 9728 KB |
subtask_1_33.txt | AC | 163 ms | 9084 KB |
subtask_1_34.txt | AC | 154 ms | 9600 KB |
subtask_1_35.txt | AC | 149 ms | 9472 KB |
subtask_1_36.txt | AC | 156 ms | 9728 KB |
subtask_1_37.txt | AC | 163 ms | 9080 KB |
subtask_1_38.txt | AC | 154 ms | 9600 KB |
subtask_1_39.txt | AC | 153 ms | 9472 KB |
subtask_1_40.txt | AC | 152 ms | 9728 KB |
subtask_1_41.txt | AC | 143 ms | 7932 KB |
subtask_1_42.txt | AC | 140 ms | 7932 KB |
subtask_1_43.txt | AC | 143 ms | 7932 KB |
subtask_1_44.txt | AC | 138 ms | 7424 KB |
subtask_1_45.txt | AC | 131 ms | 7168 KB |
subtask_1_46.txt | AC | 133 ms | 7800 KB |
subtask_1_47.txt | AC | 128 ms | 7680 KB |
subtask_1_48.txt | AC | 132 ms | 7676 KB |
subtask_1_49.txt | AC | 134 ms | 7680 KB |
subtask_1_50.txt | AC | 123 ms | 6912 KB |
subtask_1_51.txt | AC | 3 ms | 3968 KB |
subtask_1_52.txt | AC | 3 ms | 3968 KB |
subtask_1_53.txt | AC | 3 ms | 3968 KB |
subtask_1_54.txt | AC | 3 ms | 3968 KB |
subtask_1_55.txt | AC | 3 ms | 3968 KB |