Submission #415704

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;
int main(){
	int N, D, K;
	cin >> N >> D >> K;
	vector<int> Ls;
	vector<int> Rs;
	for ( size_t i = 0; i < D; i++ )
	{
		int L, R;
		cin >> L >> R;
		Ls.push_back(L);
		Rs.push_back(R);
	}
	for ( size_t i = 0; i < K; i++ )
	{
		int S, T;
		cin >> S >> T;
		int n = S;
		int min = 0;
		if ( S < T )
			for ( size_t i = 0; i < D; i++ )
			{
				min++;
				if ( Ls[i] <= n && n <= Rs[i] ){
					if ( Ls[i] <= T && T <= Rs[i] )break;
					n = Rs[i];
				}
			}
		if ( S > T )
			for ( size_t i = 0; i < D; i++ )
			{
				min++;
				if ( Ls[i] <= n && n <= Rs[i] ){
					if ( Ls[i] <= T && T <= Rs[i] )break;
					n = Ls[i];
				}
			}
		cout << min << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task C - 民族大移動
User toikage
Language C++14 (Clang++ 3.4)
Score 100
Code Size 769 Byte
Status AC
Exec Time 48 ms
Memory 940 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 49
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 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, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt, subtask1_40.txt, subtask1_41.txt, subtask1_42.txt, subtask1_43.txt, subtask1_44.txt, subtask1_45.txt, subtask1_46.txt, subtask1_47.txt, subtask1_48.txt, subtask1_49.txt
Case Name Status Exec Time Memory
sample_01.txt AC 26 ms 800 KiB
sample_02.txt AC 23 ms 916 KiB
sample_03.txt AC 25 ms 788 KiB
subtask1_01.txt AC 36 ms 920 KiB
subtask1_02.txt AC 29 ms 808 KiB
subtask1_03.txt AC 32 ms 856 KiB
subtask1_04.txt AC 38 ms 860 KiB
subtask1_05.txt AC 39 ms 880 KiB
subtask1_06.txt AC 38 ms 924 KiB
subtask1_07.txt AC 37 ms 796 KiB
subtask1_08.txt AC 31 ms 800 KiB
subtask1_09.txt AC 36 ms 796 KiB
subtask1_10.txt AC 28 ms 732 KiB
subtask1_11.txt AC 35 ms 924 KiB
subtask1_12.txt AC 30 ms 924 KiB
subtask1_13.txt AC 29 ms 628 KiB
subtask1_14.txt AC 38 ms 916 KiB
subtask1_15.txt AC 48 ms 856 KiB
subtask1_16.txt AC 42 ms 928 KiB
subtask1_17.txt AC 39 ms 928 KiB
subtask1_18.txt AC 40 ms 932 KiB
subtask1_19.txt AC 40 ms 924 KiB
subtask1_20.txt AC 38 ms 940 KiB
subtask1_21.txt AC 39 ms 928 KiB
subtask1_22.txt AC 39 ms 936 KiB
subtask1_23.txt AC 39 ms 928 KiB
subtask1_24.txt AC 39 ms 932 KiB
subtask1_25.txt AC 38 ms 932 KiB
subtask1_26.txt AC 39 ms 932 KiB
subtask1_27.txt AC 39 ms 932 KiB
subtask1_28.txt AC 39 ms 932 KiB
subtask1_29.txt AC 38 ms 928 KiB
subtask1_30.txt AC 40 ms 928 KiB
subtask1_31.txt AC 39 ms 932 KiB
subtask1_32.txt AC 38 ms 936 KiB
subtask1_33.txt AC 39 ms 928 KiB
subtask1_34.txt AC 39 ms 928 KiB
subtask1_35.txt AC 37 ms 932 KiB
subtask1_36.txt AC 37 ms 932 KiB
subtask1_37.txt AC 38 ms 936 KiB
subtask1_38.txt AC 39 ms 940 KiB
subtask1_39.txt AC 40 ms 924 KiB
subtask1_40.txt AC 40 ms 928 KiB
subtask1_41.txt AC 43 ms 928 KiB
subtask1_42.txt AC 46 ms 924 KiB
subtask1_43.txt AC 45 ms 928 KiB
subtask1_44.txt AC 45 ms 932 KiB
subtask1_45.txt AC 45 ms 940 KiB
subtask1_46.txt AC 44 ms 928 KiB
subtask1_47.txt AC 44 ms 936 KiB
subtask1_48.txt AC 45 ms 928 KiB
subtask1_49.txt AC 43 ms 924 KiB