提出 #51827583


ソースコード 拡げる

// Problem: C - Ideal Holidays
// Contest: AtCoder - AtCoder Beginner Contest 347
// URL: https://atcoder.jp/contests/abc347/tasks/abc347_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

using namespace std;

//#define int long long
typedef long long ll;
typedef unsigned long long LL;
typedef pair<int, int> PII;

struct FASTREAD {
	template <typename T>
	FASTREAD& operator >>(T& x) {
		x = 0; bool flg = false; char c = getchar();
		while (c < '0' || c > '9') flg |= (c == '-'), c = getchar();
		while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();
		if (flg) x = -x; return *this;
	}
	template <typename T>
	FASTREAD& operator >>(vector<T>& x) {
		for (auto it = x.begin(); it != x.end(); ++ it ) (*this) >> *it;
		return *this;
	}
}fin;

struct FASTWRITE {
	template <typename T>
	FASTWRITE& operator <<(T x) {
		if (x < 0) x = -x, putchar('-');
		static int buf[35]; int top = 0;
		do buf[top ++ ] = x % 10, x /= 10; while (x);
		while (top) putchar(buf[ -- top] + '0');
		return *this;
	}
	FASTWRITE& operator <<(char x) {
		putchar(x); return *this;
	}
	template <typename T>
	FASTWRITE& operator <<(vector<T> x) {
		for (auto it = x.begin(); it != x.end(); ++ it ) (*this) << *it, putchar(' ');
		putchar('\n');
		return *this;
	}
}fout;

const int N = 1e6 + 10;
const int P = 998244353;

int n, a, b, d[N];

int F(int x) {
	return x % (a + b) == 0 ? (a + b) : x % (a + b);
}

void Luogu_UID_748509() {
	fin >>n  >> a >> b;
	int mn = 1e9, mx = -1e9;
	for (int i = 1; i <= n; ++ i ) {
		fin >> d[i]; mn = min(mn, d[i] % (a + b)); mx = max(mx, d[i] % (a + b));
	}
	if (mx - mn < a || a + b - mx + mx < a) puts("Yes");
	// puts("Yes");
	else puts("No");
}

signed main() {
	int Testcases = 1;
//	fin >> Testcases;
	while (Testcases -- ) Luogu_UID_748509();
	return 0;
}

提出情報

提出日時
問題 C - Ideal Holidays
ユーザ huk2
言語 C++ 20 (gcc 12.2)
得点 0
コード長 1959 Byte
結果 WA
実行時間 7 ms
メモリ 4392 KiB

コンパイルエラー

Main.cpp: In member function ‘FASTREAD& FASTREAD::operator>>(T&)’:
Main.cpp:24:17: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   24 |                 if (flg) x = -x; return *this;
      |                 ^~
Main.cpp:24:34: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   24 |                 if (flg) x = -x; return *this;
      |                                  ^~~~~~

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 0 / 350
結果
AC × 3
AC × 51
WA × 1
セット名 テストケース
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt, 01_test_33.txt, 01_test_34.txt, 01_test_35.txt, 01_test_36.txt, 01_test_37.txt, 01_test_38.txt, 01_test_39.txt, 01_test_40.txt, 01_test_41.txt, 01_test_42.txt, 01_test_43.txt, 01_test_44.txt, 01_test_45.txt, 01_test_46.txt, 01_test_47.txt, 01_test_48.txt, 01_test_49.txt
ケース名 結果 実行時間 メモリ
00_sample_01.txt AC 1 ms 3540 KiB
00_sample_02.txt AC 1 ms 3556 KiB
00_sample_03.txt AC 1 ms 3524 KiB
01_test_01.txt AC 4 ms 4332 KiB
01_test_02.txt AC 4 ms 4392 KiB
01_test_03.txt AC 6 ms 4224 KiB
01_test_04.txt AC 6 ms 4336 KiB
01_test_05.txt AC 6 ms 4168 KiB
01_test_06.txt AC 6 ms 4204 KiB
01_test_07.txt AC 1 ms 3492 KiB
01_test_08.txt AC 1 ms 3492 KiB
01_test_09.txt AC 1 ms 3644 KiB
01_test_10.txt AC 1 ms 3452 KiB
01_test_11.txt AC 1 ms 3516 KiB
01_test_12.txt AC 1 ms 3496 KiB
01_test_13.txt AC 1 ms 3656 KiB
01_test_14.txt AC 1 ms 3644 KiB
01_test_15.txt AC 1 ms 3536 KiB
01_test_16.txt AC 1 ms 3452 KiB
01_test_17.txt AC 1 ms 3492 KiB
01_test_18.txt AC 1 ms 3500 KiB
01_test_19.txt AC 1 ms 3472 KiB
01_test_20.txt AC 1 ms 3456 KiB
01_test_21.txt AC 4 ms 3988 KiB
01_test_22.txt AC 3 ms 3848 KiB
01_test_23.txt AC 2 ms 3668 KiB
01_test_24.txt AC 1 ms 3500 KiB
01_test_25.txt AC 2 ms 3576 KiB
01_test_26.txt AC 5 ms 4092 KiB
01_test_27.txt AC 2 ms 3700 KiB
01_test_28.txt WA 3 ms 3736 KiB
01_test_29.txt AC 3 ms 3756 KiB
01_test_30.txt AC 5 ms 4048 KiB
01_test_31.txt AC 4 ms 3840 KiB
01_test_32.txt AC 4 ms 3992 KiB
01_test_33.txt AC 2 ms 3832 KiB
01_test_34.txt AC 3 ms 3848 KiB
01_test_35.txt AC 6 ms 4332 KiB
01_test_36.txt AC 6 ms 4320 KiB
01_test_37.txt AC 6 ms 4268 KiB
01_test_38.txt AC 6 ms 4332 KiB
01_test_39.txt AC 7 ms 4332 KiB
01_test_40.txt AC 6 ms 4336 KiB
01_test_41.txt AC 6 ms 4272 KiB
01_test_42.txt AC 6 ms 4272 KiB
01_test_43.txt AC 6 ms 4236 KiB
01_test_44.txt AC 6 ms 4272 KiB
01_test_45.txt AC 6 ms 4272 KiB
01_test_46.txt AC 6 ms 4336 KiB
01_test_47.txt AC 6 ms 4392 KiB
01_test_48.txt AC 6 ms 4316 KiB
01_test_49.txt AC 6 ms 4256 KiB