Submission #1135676


Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<stack>
#include<functional>
#include<list>
#define int long long
using namespace std;

int e[10000], f[100000];
signed main(){
	int a, b, c, d; cin >> a >> b >> c >> d;
	for (int g = 0; g < a; g++)scanf("%lld", &e[g]);
	for (int g = 0; g < b; g++)scanf("%lld", &f[g]);
	int time = 1;
	int X = 0, Y = 0;
	int i = 0;
	for (; i < 100005; i++) {
		for (; X < a; X++) {
			if (e[X] >= time)break;
			if (a - 1 == X)goto l;
		}
		time += c;
		for (; Y < b; Y++) {
			if (f[Y] >= time)break;
			if (b - 1 == Y)goto l;
		}
		time += d;
	}
l:;
	cout << i << endl;
}

Submission Info

Submission Time
Task C - 飛行機乗り
User naoki2016
Language C++14 (GCC 5.4.1)
Score 0
Code Size 720 Byte
Status RE
Exec Time 99 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int g = 0; g < a; g++)scanf("%lld", &e[g]);
                                                 ^
./Main.cpp:18:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int g = 0; g < b; g++)scanf("%lld", &f[g]);
                                                 ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 2
WA × 1
AC × 2
WA × 1
RE × 15
AC × 2
WA × 1
RE × 30
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
Subtask1 subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt RE 96 ms 384 KB
subtask0_1.txt RE 97 ms 384 KB
subtask0_10.txt RE 98 ms 256 KB
subtask0_11.txt RE 98 ms 256 KB
subtask0_12.txt RE 97 ms 256 KB
subtask0_13.txt RE 97 ms 256 KB
subtask0_14.txt RE 96 ms 384 KB
subtask0_2.txt RE 97 ms 384 KB
subtask0_3.txt RE 97 ms 256 KB
subtask0_4.txt RE 96 ms 384 KB
subtask0_5.txt RE 96 ms 256 KB
subtask0_6.txt RE 97 ms 384 KB
subtask0_7.txt RE 96 ms 256 KB
subtask0_8.txt RE 97 ms 384 KB
subtask0_9.txt RE 97 ms 256 KB
subtask0_sample_01.txt AC 1 ms 256 KB
subtask0_sample_02.txt AC 1 ms 256 KB
subtask0_sample_03.txt WA 1 ms 256 KB
subtask1_0.txt RE 98 ms 256 KB
subtask1_1.txt RE 99 ms 384 KB
subtask1_10.txt RE 99 ms 256 KB
subtask1_11.txt RE 98 ms 256 KB
subtask1_12.txt RE 98 ms 256 KB
subtask1_13.txt RE 97 ms 384 KB
subtask1_14.txt RE 97 ms 256 KB
subtask1_2.txt RE 99 ms 256 KB
subtask1_3.txt RE 97 ms 384 KB
subtask1_4.txt RE 99 ms 384 KB
subtask1_5.txt RE 98 ms 384 KB
subtask1_6.txt RE 99 ms 256 KB
subtask1_7.txt RE 98 ms 256 KB
subtask1_8.txt RE 98 ms 384 KB
subtask1_9.txt RE 98 ms 256 KB