oj.uz

Submission #9655

# Submission time Handle Problem Language Result Execution time Memory
9655 2014-09-28T07:51:39 Z effserv N-orthotope (kriii2_N) C++
4 / 4
 0 ms 1212 KB 
/* 문제


*/


// 2014.

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <string>
#include <map>

using namespace std;

int det[12];
vector <int> s[2], e[2];

int main()
{
	int n,ans = 0;
	scanf("%d", &n);

	for (int i = 0; i < n; i++)
	{
		int x, y;
		scanf("%d%d", &x, &y);
		s[0].push_back(x);
		e[0].push_back(y);
	}

	bool det2 = false;

	for (int i = 0; i < n; i++)
	{
		int x, y;
		scanf("%d%d", &x, &y);

		if (s[0][i] > x)
		{
			if (e[0][i] > y)
			{
				det[i] = y - s[0][i];
			}
			else
			{
				det[i] = e[0][i] - s[0][i];
			}
		}
		else
		{
			if (e[0][i] > y)
			{
				det[i] = y - x;
			}
			else
			{
				det[i] = e[0][i] - x;
			}
		}

		if (det[i] < 0)
		{
			det2 = true;
		}
	}

	if (det2 == true)
	{
		printf("-1\n");
		return 0;
	}

		for (int i = 0; i < n; i++)
		{
			if (det[i] > 0)
				ans++;
		}
		printf("%d\n", ans);



	return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1212 KB Output is correct
2 Correct 0 ms 1212 KB Output is correct
3 Correct 0 ms 1212 KB Output is correct
4 Correct 0 ms 1212 KB Output is correct
5 Correct 0 ms 1212 KB Output is correct
6 Correct 0 ms 1212 KB Output is correct
7 Correct 0 ms 1212 KB Output is correct
8 Correct 0 ms 1212 KB Output is correct
9 Correct 0 ms 1212 KB Output is correct
10 Correct 0 ms 1212 KB Output is correct
11 Correct 0 ms 1212 KB Output is correct
12 Correct 0 ms 1212 KB Output is correct
13 Correct 0 ms 1212 KB Output is correct
14 Correct 0 ms 1212 KB Output is correct
15 Correct 0 ms 1212 KB Output is correct
16 Correct 0 ms 1212 KB Output is correct
17 Correct 0 ms 1212 KB Output is correct
18 Correct 0 ms 1212 KB Output is correct
19 Correct 0 ms 1212 KB Output is correct
20 Correct 0 ms 1212 KB Output is correct
21 Correct 0 ms 1212 KB Output is correct
22 Correct 0 ms 1212 KB Output is correct
23 Correct 0 ms 1212 KB Output is correct
24 Correct 0 ms 1212 KB Output is correct
25 Correct 0 ms 1212 KB Output is correct
26 Correct 0 ms 1212 KB Output is correct
27 Correct 0 ms 1212 KB Output is correct
28 Correct 0 ms 1212 KB Output is correct
29 Correct 0 ms 1212 KB Output is correct
30 Correct 0 ms 1212 KB Output is correct
31 Correct 0 ms 1212 KB Output is correct
32 Correct 0 ms 1212 KB Output is correct
33 Correct 0 ms 1212 KB Output is correct
34 Correct 0 ms 1212 KB Output is correct
35 Correct 0 ms 1212 KB Output is correct
36 Correct 0 ms 1212 KB Output is correct
37 Correct 0 ms 1212 KB Output is correct
38 Correct 0 ms 1212 KB Output is correct
39 Correct 0 ms 1212 KB Output is correct
40 Correct 0 ms 1212 KB Output is correct
41 Correct 0 ms 1212 KB Output is correct
42 Correct 0 ms 1212 KB Output is correct
43 Correct 0 ms 1212 KB Output is correct
44 Correct 0 ms 1212 KB Output is correct
45 Correct 0 ms 1212 KB Output is correct
46 Correct 0 ms 1212 KB Output is correct
47 Correct 0 ms 1212 KB Output is correct
48 Correct 0 ms 1212 KB Output is correct
49 Correct 0 ms 1212 KB Output is correct
50 Correct 0 ms 1212 KB Output is correct
51 Correct 0 ms 1212 KB Output is correct
52 Correct 0 ms 1212 KB Output is correct
53 Correct 0 ms 1212 KB Output is correct
54 Correct 0 ms 1212 KB Output is correct
55 Correct 0 ms 1212 KB Output is correct
56 Correct 0 ms 1212 KB Output is correct
57 Correct 0 ms 1212 KB Output is correct
58 Correct 0 ms 1212 KB Output is correct
59 Correct 0 ms 1212 KB Output is correct
60 Correct 0 ms 1212 KB Output is correct
61 Correct 0 ms 1212 KB Output is correct
62 Correct 0 ms 1212 KB Output is correct
63 Correct 0 ms 1212 KB Output is correct
64 Correct 0 ms 1212 KB Output is correct
65 Correct 0 ms 1212 KB Output is correct
66 Correct 0 ms 1212 KB Output is correct
67 Correct 0 ms 1212 KB Output is correct
68 Correct 0 ms 1212 KB Output is correct
69 Correct 0 ms 1212 KB Output is correct
70 Correct 0 ms 1212 KB Output is correct
71 Correct 0 ms 1212 KB Output is correct
72 Correct 0 ms 1212 KB Output is correct
73 Correct 0 ms 1212 KB Output is correct
74 Correct 0 ms 1212 KB Output is correct
75 Correct 0 ms 1212 KB Output is correct
76 Correct 0 ms 1212 KB Output is correct
77 Correct 0 ms 1212 KB Output is correct
78 Correct 0 ms 1212 KB Output is correct
79 Correct 0 ms 1212 KB Output is correct
80 Correct 0 ms 1212 KB Output is correct
81 Correct 0 ms 1212 KB Output is correct
82 Correct 0 ms 1212 KB Output is correct
83 Correct 0 ms 1212 KB Output is correct
84 Correct 0 ms 1212 KB Output is correct
85 Correct 0 ms 1212 KB Output is correct
86 Correct 0 ms 1212 KB Output is correct
87 Correct 0 ms 1212 KB Output is correct
88 Correct 0 ms 1212 KB Output is correct
89 Correct 0 ms 1212 KB Output is correct
90 Correct 0 ms 1212 KB Output is correct
91 Correct 0 ms 1212 KB Output is correct
92 Correct 0 ms 1212 KB Output is correct
93 Correct 0 ms 1212 KB Output is correct
94 Correct 0 ms 1212 KB Output is correct
95 Correct 0 ms 1212 KB Output is correct
96 Correct 0 ms 1212 KB Output is correct
97 Correct 0 ms 1212 KB Output is correct
98 Correct 0 ms 1212 KB Output is correct
99 Correct 0 ms 1212 KB Output is correct
100 Correct 0 ms 1212 KB Output is correct