Submission #5018645
Source Code Expand
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Vec2(T, n, m, xs, x0) vector<vector<T>> xs(n, vector<T>(m, x0))
#define Sum(a) accumulate(Range(a), 0)
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) Vec2(T, n, m, xs); For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
// constexpr int MOD = 1e9+7;
int main(void){
Cin(ll, n, a, b, c, d);
For(i, n){
ll al = a + c*i;
ll au = a + d*i;
ll bl = b + c*(n-1-i);
ll bu = b + d*(n-1-i);
if(al <= bu && bl <= au){
Cout("YES");
return 0;
}
}
Cout("NO");
}
Submission Info
Submission Time |
|
Task |
B - Moderate Differences |
User |
youjotape |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
2298 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All |
sample1.txt, sample2.txt, sample3.txt, sample4.txt, a01.txt, a02.txt, a03.txt, a04.txt, b01.txt, b02.txt, b03.txt, b04.txt, c01.txt, c02.txt, c03.txt, c04.txt, d01.txt, d02.txt, d03.txt, d04.txt, d05.txt, d06.txt, d07.txt, d08.txt, d09.txt, d10.txt, d11.txt, d12.txt, d13.txt, d14.txt, d15.txt, d16.txt, d17.txt, d18.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt |
Case Name |
Status |
Exec Time |
Memory |
a01.txt |
AC |
1 ms |
256 KB |
a02.txt |
AC |
1 ms |
256 KB |
a03.txt |
AC |
1 ms |
256 KB |
a04.txt |
AC |
1 ms |
256 KB |
b01.txt |
AC |
2 ms |
256 KB |
b02.txt |
AC |
2 ms |
256 KB |
b03.txt |
AC |
2 ms |
256 KB |
b04.txt |
AC |
1 ms |
256 KB |
c01.txt |
AC |
2 ms |
256 KB |
c02.txt |
AC |
1 ms |
256 KB |
c03.txt |
AC |
2 ms |
256 KB |
c04.txt |
AC |
2 ms |
256 KB |
d01.txt |
AC |
1 ms |
256 KB |
d02.txt |
AC |
1 ms |
256 KB |
d03.txt |
AC |
1 ms |
256 KB |
d04.txt |
AC |
2 ms |
256 KB |
d05.txt |
AC |
2 ms |
256 KB |
d06.txt |
AC |
1 ms |
256 KB |
d07.txt |
AC |
1 ms |
256 KB |
d08.txt |
AC |
1 ms |
256 KB |
d09.txt |
AC |
1 ms |
256 KB |
d10.txt |
AC |
2 ms |
256 KB |
d11.txt |
AC |
1 ms |
256 KB |
d12.txt |
AC |
2 ms |
256 KB |
d13.txt |
AC |
1 ms |
256 KB |
d14.txt |
AC |
1 ms |
256 KB |
d15.txt |
AC |
2 ms |
256 KB |
d16.txt |
AC |
2 ms |
256 KB |
d17.txt |
AC |
1 ms |
256 KB |
d18.txt |
AC |
1 ms |
256 KB |
sample1.txt |
AC |
1 ms |
256 KB |
sample2.txt |
AC |
1 ms |
256 KB |
sample3.txt |
AC |
1 ms |
256 KB |
sample4.txt |
AC |
2 ms |
256 KB |