oj.uz

Submission #529049

# Submission time Handle Problem Language Result Execution time Memory
529049 2022-02-22T03:50:40 Z penguinhacker Kućice (COCI21_kucice) C++14
110 / 110
 76 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

struct Point {
	ll x, y;
	Point operator-(const Point& o) const {
		return {x-o.x, y-o.y};
	}
	ll operator*(const Point& o) const {
		return x*o.y-y*o.x;
	}
};

const int mxN=1000, M=1e9+7;
int n, p2[mxN+1];
Point a[mxN], b[2*mxN];
ll ans;

void solve() {
	sort(b, b+n-1, [](Point x, Point y) {
		int tx=(x.y>0||x.x>0&&x.y==0)?1:2;
		int ty=(y.y>0||y.x>0&&y.y==0)?1:2;
		return tx!=ty?tx<ty:x*y>0;
	});
	for (int i=0; i<n-1; ++i)
		b[i+n-1]=b[i];
	ans=(ans+p2[n]-1)%M;
	for (int i=0, j=0; i<n-1; ++i) {
		j=max(j, i);
		while(j+1<i+n-1&&b[i]*b[j+1]>0)
			++j;
		ans=(ans-p2[j-i]+M)%M;
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i=0; i<n; ++i)
		cin >> a[i].x >> a[i].y;
	p2[0]=1;
	for (int i=1; i<=n; ++i)
		p2[i]=p2[i-1]*2%M;
	for (int i=0; i<n; ++i) {
		for (int j=0; j<n; ++j)
			if (i!=j)
				b[j-(j>i)]=a[j]-a[i];
		solve();
	}
	cout << ans;
	return 0;
}

Compilation message

Main.cpp: In lambda function:
Main.cpp:24:23: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   24 |   int tx=(x.y>0||x.x>0&&x.y==0)?1:2;
      |                  ~~~~~^~~~~~~~
Main.cpp:25:23: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   25 |   int ty=(y.y>0||y.x>0&&y.y==0)?1:2;
      |                  ~~~~~^~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 69 ms 332 KB Output is correct
7 Correct 70 ms 332 KB Output is correct
8 Correct 59 ms 364 KB Output is correct
9 Correct 68 ms 328 KB Output is correct
10 Correct 59 ms 356 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 61 ms 332 KB Output is correct
7 Correct 68 ms 356 KB Output is correct
8 Correct 58 ms 356 KB Output is correct
9 Correct 76 ms 332 KB Output is correct
10 Correct 56 ms 360 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 69 ms 332 KB Output is correct
7 Correct 70 ms 332 KB Output is correct
8 Correct 59 ms 364 KB Output is correct
9 Correct 68 ms 328 KB Output is correct
10 Correct 59 ms 356 KB Output is correct
11 Correct 0 ms 308 KB Output is correct
12 Correct 0 ms 312 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 61 ms 332 KB Output is correct
17 Correct 68 ms 356 KB Output is correct
18 Correct 58 ms 356 KB Output is correct
19 Correct 76 ms 332 KB Output is correct
20 Correct 56 ms 360 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 316 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 316 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 320 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 316 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 70 ms 364 KB Output is correct
58 Correct 57 ms 332 KB Output is correct
59 Correct 72 ms 356 KB Output is correct
60 Correct 63 ms 364 KB Output is correct
61 Correct 74 ms 332 KB Output is correct
62 Correct 64 ms 356 KB Output is correct
63 Correct 58 ms 364 KB Output is correct
64 Correct 69 ms 364 KB Output is correct
65 Correct 69 ms 360 KB Output is correct