Submission #1624080
Source Code Expand
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#ifndef MAJK_LIB
#define MAJK_LIB
#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <bitset>
using namespace std;
#define x first
#define y second
constexpr int MOD = 1000000007;
typedef std::pair<int,int> pii;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
auto fraclt = [](const pii&a,const pii&b) { return (ll)a.x * b.y < (ll)b.x * a.y; };
struct cmpfrac { bool operator()(const pii&a,const pii&b)const { return (ll)a.x * b.y < (ll)b.x * a.y; }};
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(ll x) {ui b=0;while(x){x>>=1;++b;}return b;}
namespace std {
template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}};
}
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }
template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector<vector<T>>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector<vector<T>>>(a,vector<vector<T>>(b,vector<T>(c,t))){}};
template <typename T> struct bounded_priority_queue {
inline bounded_priority_queue(ui X) : A(X), B(0) {}
inline void push(ui L, T V) { B = max(B, L); A[L].push(V); }
inline const T &top() const { return A[B].front(); }
inline void pop() { A[B].pop(); while (B > 0 && A[B].empty()) --B; }
inline bool empty() const { return A[B].empty(); }
inline void clear() { B = 0; for (auto &a: A) a = queue<T>(); }
private:
vector<queue<T>> A; ui B;
};
#endif
// #include "../l/mod.h"
class B {
public:
void solve(istream& cin, ostream& cout) {
ll N,A,B,C,D; cin >> N >> A >> B >> C >> D;
for (int i = 0; i < N-1; ++i) {
if (A-B + i*C - (N-1-i)*D <= 0 && A-B + i*D - (N-1-i)*C >= 0) {
cout << "YES\n";
return;
}
}
cout << "NO\n";
}
};
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
B solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Moderate Differences |
User |
majk |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3477 Byte |
Status |
AC |
Exec Time |
1 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 |
1 ms |
256 KB |
b02.txt |
AC |
1 ms |
256 KB |
b03.txt |
AC |
1 ms |
256 KB |
b04.txt |
AC |
1 ms |
256 KB |
c01.txt |
AC |
1 ms |
256 KB |
c02.txt |
AC |
1 ms |
256 KB |
c03.txt |
AC |
1 ms |
256 KB |
c04.txt |
AC |
1 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 |
1 ms |
256 KB |
d05.txt |
AC |
1 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 |
1 ms |
256 KB |
d11.txt |
AC |
1 ms |
256 KB |
d12.txt |
AC |
1 ms |
256 KB |
d13.txt |
AC |
1 ms |
256 KB |
d14.txt |
AC |
1 ms |
256 KB |
d15.txt |
AC |
1 ms |
256 KB |
d16.txt |
AC |
1 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 |
1 ms |
256 KB |