Submission #34617457

Source Code Expand

#include <queue>
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
constexpr int max_n=300000;
pair<int,int>pr[max_n+1];
int main(){
	priority_queue<int>pqa,pqb;
	priority_queue<int,vector<int>,greater<int> >pqc;
	int n;
	scanf("%d",&n);
	for(int i=1; i<=n; ++i){
		scanf("%d%d",&pr[i].first,&pr[i].second);
		if(pr[i].first<pr[i].second){
			pqa.emplace(pr[i].first),
			pqb.emplace(pr[i].second);
			--i,--n;
		}
	}
	sort(pr+1,pr+n+1);
	int ans=n,i=n;
	while(!pqb.empty()){
		const int u=pqb.top();
		pqb.pop();
		if(pqa.top()>=u){
			pqa.pop();
			continue;
		}
		for(; i&&pr[i].first>=u; --i)
			pqc.emplace(pr[i].second);
		if(!pqc.empty()&&pqc.top()<u){
			pqb.emplace(pqc.top());
			pqc.pop(),--ans;
			continue;
		}
		puts("-1");
		return 0;
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task E - Examination
User wangzhifang
Language C++ (GCC 9.2.1)
Score 800
Code Size 898 Byte
Status AC
Exec Time 148 ms
Memory 5720 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   14 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
./Main.cpp:16:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   16 |   scanf("%d%d",&pr[i].first,&pr[i].second);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 4
AC × 86
Set Name Test Cases
Sample sample_00.txt, sample_01.txt, sample_02.txt, sample_03.txt
All case_00.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt, case_16.txt, case_17.txt, case_18.txt, case_19.txt, case_20.txt, case_21.txt, case_22.txt, case_23.txt, case_24.txt, case_25.txt, case_26.txt, case_27.txt, case_28.txt, case_29.txt, case_30.txt, case_31.txt, case_32.txt, case_33.txt, case_34.txt, case_35.txt, case_36.txt, case_37.txt, case_38.txt, case_39.txt, case_40.txt, case_41.txt, case_42.txt, case_43.txt, case_44.txt, case_45.txt, case_46.txt, case_47.txt, case_48.txt, case_49.txt, case_50.txt, case_51.txt, case_52.txt, case_53.txt, case_54.txt, case_55.txt, case_56.txt, case_57.txt, case_58.txt, case_59.txt, case_60.txt, case_61.txt, case_62.txt, case_63.txt, case_64.txt, case_65.txt, case_66.txt, case_67.txt, case_68.txt, case_69.txt, case_70.txt, case_71.txt, case_72.txt, case_73.txt, case_74.txt, case_75.txt, case_76.txt, case_77.txt, case_78.txt, case_79.txt, case_80.txt, case_81.txt, sample_00.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
case_00.txt AC 8 ms 3072 KiB
case_01.txt AC 2 ms 3084 KiB
case_02.txt AC 2 ms 3160 KiB
case_03.txt AC 2 ms 2924 KiB
case_04.txt AC 2 ms 2924 KiB
case_05.txt AC 2 ms 3092 KiB
case_06.txt AC 53 ms 4184 KiB
case_07.txt AC 38 ms 3776 KiB
case_08.txt AC 51 ms 3944 KiB
case_09.txt AC 76 ms 5244 KiB
case_10.txt AC 6 ms 3052 KiB
case_11.txt AC 84 ms 5324 KiB
case_12.txt AC 85 ms 5220 KiB
case_13.txt AC 83 ms 5328 KiB
case_14.txt AC 84 ms 5256 KiB
case_15.txt AC 86 ms 5220 KiB
case_16.txt AC 83 ms 4128 KiB
case_17.txt AC 83 ms 4076 KiB
case_18.txt AC 71 ms 4040 KiB
case_19.txt AC 10 ms 3256 KiB
case_20.txt AC 59 ms 3696 KiB
case_21.txt AC 88 ms 4268 KiB
case_22.txt AC 9 ms 3276 KiB
case_23.txt AC 117 ms 4724 KiB
case_24.txt AC 126 ms 5320 KiB
case_25.txt AC 113 ms 4808 KiB
case_26.txt AC 144 ms 5324 KiB
case_27.txt AC 144 ms 5252 KiB
case_28.txt AC 147 ms 5320 KiB
case_29.txt AC 144 ms 5248 KiB
case_30.txt AC 143 ms 5228 KiB
case_31.txt AC 144 ms 5208 KiB
case_32.txt AC 144 ms 5224 KiB
case_33.txt AC 143 ms 5292 KiB
case_34.txt AC 144 ms 5344 KiB
case_35.txt AC 147 ms 5328 KiB
case_36.txt AC 144 ms 5320 KiB
case_37.txt AC 144 ms 5184 KiB
case_38.txt AC 146 ms 5220 KiB
case_39.txt AC 145 ms 5208 KiB
case_40.txt AC 144 ms 5260 KiB
case_41.txt AC 144 ms 5184 KiB
case_42.txt AC 148 ms 5196 KiB
case_43.txt AC 145 ms 5284 KiB
case_44.txt AC 144 ms 5352 KiB
case_45.txt AC 143 ms 5280 KiB
case_46.txt AC 70 ms 5488 KiB
case_47.txt AC 70 ms 5416 KiB
case_48.txt AC 70 ms 5364 KiB
case_49.txt AC 71 ms 5536 KiB
case_50.txt AC 63 ms 4608 KiB
case_51.txt AC 66 ms 4660 KiB
case_52.txt AC 63 ms 4608 KiB
case_53.txt AC 56 ms 4300 KiB
case_54.txt AC 49 ms 4264 KiB
case_55.txt AC 69 ms 4672 KiB
case_56.txt AC 20 ms 3704 KiB
case_57.txt AC 33 ms 3600 KiB
case_58.txt AC 68 ms 4604 KiB
case_59.txt AC 74 ms 4916 KiB
case_60.txt AC 87 ms 5700 KiB
case_61.txt AC 86 ms 5588 KiB
case_62.txt AC 87 ms 5616 KiB
case_63.txt AC 88 ms 5628 KiB
case_64.txt AC 86 ms 5612 KiB
case_65.txt AC 86 ms 5720 KiB
case_66.txt AC 86 ms 5608 KiB
case_67.txt AC 86 ms 5616 KiB
case_68.txt AC 87 ms 5628 KiB
case_69.txt AC 90 ms 5696 KiB
case_70.txt AC 2 ms 3040 KiB
case_71.txt AC 2 ms 3068 KiB
case_72.txt AC 2 ms 3004 KiB
case_73.txt AC 2 ms 2960 KiB
case_74.txt AC 26 ms 3548 KiB
case_75.txt AC 73 ms 4760 KiB
case_76.txt AC 27 ms 3536 KiB
case_77.txt AC 44 ms 3904 KiB
case_78.txt AC 84 ms 5320 KiB
case_79.txt AC 86 ms 5292 KiB
case_80.txt AC 84 ms 5292 KiB
case_81.txt AC 84 ms 5212 KiB
sample_00.txt AC 3 ms 3128 KiB
sample_01.txt AC 2 ms 3132 KiB
sample_02.txt AC 2 ms 3016 KiB
sample_03.txt AC 2 ms 3148 KiB