Submission #1372034
Source Code Expand
#include <iostream> using namespace std; int main() { // 入力 int N, D, K; // N:街の数、D:移動にかける日数、K:民族の種類数 cin >> N >> D >> K; int L[D], R[D]; for (int i = 0; i < D; i++) cin >> L[i] >> R[i]; int S[K], T[K]; for (int i = 0; i < K; i++) cin >> S[i] >> T[i]; // K回、移動のシミュレーションをして、目的地に到着できる最短日数を求める for (int i = 0; i < K; i++) { // 街は一直線上に並んでいると仮定する int ans = 0; for (int j = 0; j < D; j++) { if (L[j] <= S[i] && S[i] <= R[j]) { if (L[j] <= T[i] && T[i] <= R[j]) { ans = j + 1; break; } if (S[i] < T[i]) S[i] = R[j]; else S[i] = L[j]; } } // 解答 cout << ans << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 民族大移動 |
User | university |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 863 Byte |
Status | AC |
Exec Time | 15 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
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, 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 8 ms | 256 KB |
subtask1_02.txt | AC | 4 ms | 256 KB |
subtask1_03.txt | AC | 6 ms | 256 KB |
subtask1_04.txt | AC | 10 ms | 256 KB |
subtask1_05.txt | AC | 11 ms | 256 KB |
subtask1_06.txt | AC | 10 ms | 256 KB |
subtask1_07.txt | AC | 9 ms | 256 KB |
subtask1_08.txt | AC | 5 ms | 256 KB |
subtask1_09.txt | AC | 9 ms | 256 KB |
subtask1_10.txt | AC | 3 ms | 256 KB |
subtask1_11.txt | AC | 10 ms | 256 KB |
subtask1_12.txt | AC | 5 ms | 256 KB |
subtask1_13.txt | AC | 2 ms | 256 KB |
subtask1_14.txt | AC | 10 ms | 256 KB |
subtask1_15.txt | AC | 12 ms | 384 KB |
subtask1_16.txt | AC | 12 ms | 256 KB |
subtask1_17.txt | AC | 12 ms | 256 KB |
subtask1_18.txt | AC | 12 ms | 384 KB |
subtask1_19.txt | AC | 12 ms | 256 KB |
subtask1_20.txt | AC | 12 ms | 384 KB |
subtask1_21.txt | AC | 12 ms | 256 KB |
subtask1_22.txt | AC | 12 ms | 256 KB |
subtask1_23.txt | AC | 12 ms | 384 KB |
subtask1_24.txt | AC | 12 ms | 256 KB |
subtask1_25.txt | AC | 11 ms | 256 KB |
subtask1_26.txt | AC | 12 ms | 384 KB |
subtask1_27.txt | AC | 12 ms | 384 KB |
subtask1_28.txt | AC | 12 ms | 384 KB |
subtask1_29.txt | AC | 12 ms | 384 KB |
subtask1_30.txt | AC | 12 ms | 384 KB |
subtask1_31.txt | AC | 12 ms | 384 KB |
subtask1_32.txt | AC | 12 ms | 256 KB |
subtask1_33.txt | AC | 12 ms | 256 KB |
subtask1_34.txt | AC | 12 ms | 384 KB |
subtask1_35.txt | AC | 12 ms | 256 KB |
subtask1_36.txt | AC | 12 ms | 256 KB |
subtask1_37.txt | AC | 12 ms | 384 KB |
subtask1_38.txt | AC | 12 ms | 384 KB |
subtask1_39.txt | AC | 12 ms | 256 KB |
subtask1_40.txt | AC | 12 ms | 256 KB |
subtask1_41.txt | AC | 14 ms | 256 KB |
subtask1_42.txt | AC | 15 ms | 256 KB |
subtask1_43.txt | AC | 15 ms | 256 KB |
subtask1_44.txt | AC | 15 ms | 384 KB |
subtask1_45.txt | AC | 15 ms | 256 KB |
subtask1_46.txt | AC | 15 ms | 256 KB |
subtask1_47.txt | AC | 15 ms | 384 KB |
subtask1_48.txt | AC | 15 ms | 384 KB |
subtask1_49.txt | AC | 14 ms | 256 KB |