Submission #3785123
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define fi first #define se second #define FOR(i, a, b) for(int i=(a);i<(b);i++) #define REP(i, n) FOR(i, 0, n) #define RFOR(i, a, b) for(int i=(a);i>=(b);i--) #define RREP(i, n) RFOR(i, n, 0) #define MFOR(i, m) for(auto i=(m).begin();i!=(m).end();i++) #define ALL(a) (a).begin(), (a).end() #define SZ(x) ((int)(x).size()) typedef long long int ll; typedef pair<int, int> P; typedef pair<ll, ll> Pll; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vll; typedef vector<vll> vvll; const double eps = 1e-10; const int MOD = 1000000007; const int INF = 1000000000; const ll LINF = 1 << 30; template<typename T> void printv(vector<T> const& s) { REP(i, SZ(s)) { cout << s[i] << " "; } cout << endl; } int main () { cin.tie(0); cout << setprecision(10); ll n, a, b, c, d; cin >> n >> a >> b >> c >> d; ll diff = abs(a-b); if((diff > d * (n-1)) || (n%2 && diff == 0) || (!(n%2) && diff == c)) { cout << "NO" << endl; } else { cout << "YES" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - Moderate Differences |
User | kanra824 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1156 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 1 ms | 256 KB |
b02.txt | WA | 1 ms | 256 KB |
b03.txt | WA | 1 ms | 256 KB |
b04.txt | WA | 1 ms | 256 KB |
c01.txt | WA | 1 ms | 256 KB |
c02.txt | AC | 1 ms | 256 KB |
c03.txt | WA | 1 ms | 256 KB |
c04.txt | WA | 1 ms | 256 KB |
d01.txt | AC | 1 ms | 256 KB |
d02.txt | WA | 1 ms | 256 KB |
d03.txt | WA | 1 ms | 256 KB |
d04.txt | WA | 1 ms | 256 KB |
d05.txt | WA | 1 ms | 256 KB |
d06.txt | AC | 1 ms | 256 KB |
d07.txt | AC | 1 ms | 256 KB |
d08.txt | WA | 1 ms | 256 KB |
d09.txt | WA | 1 ms | 256 KB |
d10.txt | WA | 1 ms | 256 KB |
d11.txt | AC | 1 ms | 256 KB |
d12.txt | WA | 1 ms | 256 KB |
d13.txt | AC | 1 ms | 256 KB |
d14.txt | AC | 1 ms | 256 KB |
d15.txt | WA | 1 ms | 256 KB |
d16.txt | WA | 1 ms | 256 KB |
d17.txt | WA | 1 ms | 256 KB |
d18.txt | WA | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | WA | 1 ms | 256 KB |
sample3.txt | WA | 1 ms | 256 KB |
sample4.txt | AC | 1 ms | 256 KB |