oj.uz

Submission #19070

# Submission time Handle Problem Language Result Execution time Memory
19070 2016-02-18T02:36:49 Z Namnamseo 님 무기가 좀 나쁘시네여 (kriii3_S) C++14
29 / 29
 0 ms 1084 KB 
#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);
    }
    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;
}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
11 Correct 0 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Correct 0 ms 1084 KB Output is correct
18 Correct 0 ms 1084 KB Output is correct
19 Correct 0 ms 1084 KB Output is correct
20 Correct 0 ms 1084 KB Output is correct
21 Correct 0 ms 1084 KB Output is correct
22 Correct 0 ms 1084 KB Output is correct
23 Correct 0 ms 1084 KB Output is correct
24 Correct 0 ms 1084 KB Output is correct
25 Correct 0 ms 1084 KB Output is correct
26 Correct 0 ms 1084 KB Output is correct
27 Correct 0 ms 1084 KB Output is correct
28 Correct 0 ms 1084 KB Output is correct
29 Correct 0 ms 1084 KB Output is correct
30 Correct 0 ms 1084 KB Output is correct
31 Correct 0 ms 1084 KB Output is correct
32 Correct 0 ms 1084 KB Output is correct
33 Correct 0 ms 1084 KB Output is correct
34 Correct 0 ms 1084 KB Output is correct
35 Correct 0 ms 1084 KB Output is correct
36 Correct 0 ms 1084 KB Output is correct
37 Correct 0 ms 1084 KB Output is correct
38 Correct 0 ms 1084 KB Output is correct
39 Correct 0 ms 1084 KB Output is correct
40 Correct 0 ms 1084 KB Output is correct
41 Correct 0 ms 1084 KB Output is correct
42 Correct 0 ms 1084 KB Output is correct
43 Correct 0 ms 1084 KB Output is correct
44 Correct 0 ms 1084 KB Output is correct
45 Correct 0 ms 1084 KB Output is correct
46 Correct 0 ms 1084 KB Output is correct