oj.uz

Submission #15176

# Submission time Handle Problem Language Result Execution time Memory
15176 2015-07-12T03:18:58 Z gs14004 님 무기가 좀 나쁘시네여 (kriii3_S) C++14
29 / 29
 0 ms 1084 KB 
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

struct jangvy{
	int p1, p2, p3, p4, p5;
};

jangvy operator-(jangvy a, jangvy b){
	jangvy c;
	c.p1 = a.p1 - b.p1;
	c.p2 = a.p2 - b.p2;
	c.p3 = a.p3 - b.p3;
	c.p4 = a.p4 - b.p4;
	c.p5 = a.p5 - b.p5;
	return c;
}

jangvy operator+(jangvy a, jangvy b){
	jangvy c;
	c.p1 = a.p1 + b.p1;
	c.p2 = a.p2 + b.p2;
	c.p3 = a.p3 + b.p3;
	c.p4 = a.p4+ b.p4;
	c.p5 = a.p5 + b.p5;
	return c;
}

long long val(jangvy t){
	return 1ll * t.p1 * (100 + t.p2) * ( 10000 - min(t.p3 * 100, 10000) + min(t.p3, 100) * t.p4 )* (100 + t.p5);
}

jangvy t[4];
int main(){
	for(int i=0; i<4; i++){
		int a,b,c,d,e;
		scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);
		t[i] = (jangvy){a, b, c, d, e};
	}
	jangvy cur = t[0];
	jangvy cur2 = t[1];
	jangvy nxt = t[0] + t[3];
	jangvy nxt2 = t[1] + t[2];
	nxt = nxt - t[2];
	nxt2 = nxt2 - t[3];
	if((val(cur) - val(nxt))== 0){
		puts("0");
	}
	else if(val(cur) > val(nxt)){
		puts("-");
	}
	else{
		puts("+");
	}
	cur = cur2;
	nxt = nxt2;
	if((val(cur) - val(nxt))== 0){
		puts("0");
	}
	else if(val(cur) > val(nxt)){
		puts("-");
	}
	else{
		puts("+");
	}
}

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