# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19069 | Namnamseo | 님 무기가 좀 나쁘시네여 (kriii3_S) | C++14 | 0 ms | 1084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
typedef long long ll;
template<typename T> inline T max(T a,T b){ return b<a?a:b; }
template<typename T> inline T min(T a,T b){ return a<b?a:b; }
struct state {
int a,b,c,d,e;
void read(){
scanf("%d%d%d%d%d",&a,&b,&c,&d,&e);
c=min(100,c);
}
ll getPower(){
return a*1LL*(100+b)*(10000-100*min(100,c)+min(100,c)*1LL*d)*(100+e);
}
state operator-(const state& x) const {
return {a-x.a, b-x.b, c-x.c, d-x.d, e-x.e};
}
state operator+(const state& x) const {
return {a+x.a, b+x.b, c+x.c, d+x.d, e+x.e};
}
};
void cmp(state a,state b){
ll pa=a.getPower(), pb=b.getPower();
if(pa==pb) putchar(48);
else if(pa<pb) putchar('+');
else putchar('-');
putchar(10);
}
int main()
{
state p,q,r,s;
p.read();
q.read();
r.read();
s.read();
cmp(p,p-r+s);
cmp(q,q-s+r);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |