Submission #3666945
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; //#define P pair<ll,ll> #define FOR(I,A,B) for(int I = (A); I < (B); ++I) #define FORR(I,A,B) for(int I = ((B)-1); I >= (A); --I) #define TO(x,t,f) ((x)?(t):(f)) #define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9 #define REV(x) (reverse(x.begin(),x.end())) //reverse ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;return gcd(b,a%b);} ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu #define NEXTP(x) next_permutation(x.begin(),x.end()) const ll INF=1e18+7; const ll MOD=1e9+7; #define pri(a) cout << (a) << endl int main(){ ios::sync_with_stdio(false); cin.tie(0); ll T,A,B,C,D,ans=0; cin >> T >> A >> B >> C >> D; if(T>=C){ ans = D; }else if(T>=A){ ans = B; } if(T>=(A+C))ans=D+B; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Two Problems |
User | kenta2997 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 859 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |