| Task: | Forest |
| Sender: | Anonyymit Algoritmistit |
| Submission time: | 2015-10-13 00:35:13 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.05 s | details |
| #2 | WRONG ANSWER | 0.06 s | details |
| #3 | WRONG ANSWER | 0.06 s | details |
| #4 | WRONG ANSWER | 0.06 s | details |
| #5 | WRONG ANSWER | 0.06 s | details |
| #6 | WRONG ANSWER | 0.06 s | details |
| #7 | WRONG ANSWER | 0.06 s | details |
| #8 | WRONG ANSWER | 0.05 s | details |
| #9 | WRONG ANSWER | 0.06 s | details |
| #10 | WRONG ANSWER | 0.05 s | details |
| #11 | WRONG ANSWER | 0.06 s | details |
| #12 | WRONG ANSWER | 0.07 s | details |
| #13 | WRONG ANSWER | 0.06 s | details |
| #14 | WRONG ANSWER | 0.06 s | details |
| #15 | WRONG ANSWER | 0.06 s | details |
| #16 | ACCEPTED | 0.06 s | details |
| #17 | ACCEPTED | 0.07 s | details |
| #18 | ACCEPTED | 0.06 s | details |
| #19 | ACCEPTED | 0.06 s | details |
| #20 | ACCEPTED | 0.06 s | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:37:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v.size(); i++) {
^
input/code.cpp:38:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = 0; j < v.size(); j++) {
^Code
#include <iostream>
#include <algorithm>
#include <vector>
#define ll long long
using namespace std;
bool s(pair<ll, ll> p, pair<ll, ll> a, pair<ll, ll> b) {
/*if (p.second < max(a.second, b.second)
&& p.first > min(a.first, b.first)
&& p.second > min(a.second, b.second)
&& p.first < max(a.first, b.first)) {
if (p.second == (a.first * b.second) / b.first) {
return true;
}
}*/
ll cross = a.first * b.second - b.first * a.second;
if (cross != 0) return false;
return true;
}
int main() {
vector<pair<ll, ll>> v;
int n, ux, uy, x, y;
cin >> n >> ux >> uy;
for (int i = 0; i < n; i++) {
cin >> x >> y;
v.push_back(make_pair(x - ux, y - uy));
}
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v.size(); j++) {
if (v[i] == v[j]) continue;
if (s(make_pair(ux, uy), v[i], v[j])) {
v.erase(v.begin() + i);
}
}
}
cout << v.size() << endl;
}Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 152
391446 44026 391450 44026 391448 44028 391450 44028 ... |
| correct output |
|---|
| 117 |
| user output |
|---|
| 93 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 167
-395738 -130738 -395745 -130742 -395739 -130735 -395746 -130731 ... |
| correct output |
|---|
| 124 |
| user output |
|---|
| 94 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 183
200778 460834 200784 460841 200769 460836 200773 460830 ... |
| correct output |
|---|
| 132 |
| user output |
|---|
| 98 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 130
223758 419977 223753 419974 223762 419974 223759 419983 ... |
| correct output |
|---|
| 97 |
| user output |
|---|
| 79 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 168
375864 397759 375855 397764 375855 397757 375866 397758 ... |
| correct output |
|---|
| 124 |
| user output |
|---|
| 95 |
Test 6
Verdict: WRONG ANSWER
| input |
|---|
| 187
-23941 284266 -113941 -30734 -113941 689266 -203941 329266 ... |
| correct output |
|---|
| 134 |
| user output |
|---|
| 100 |
Test 7
Verdict: WRONG ANSWER
| input |
|---|
| 127
260079 -413943 440079 -53943 575079 36057 530079 -773943 ... |
| correct output |
|---|
| 98 |
| user output |
|---|
| 77 |
Test 8
Verdict: WRONG ANSWER
| input |
|---|
| 144
411083 460318 366083 145318 771083 865318 411083 685318 ... |
| correct output |
|---|
| 109 |
| user output |
|---|
| 80 |
Test 9
Verdict: WRONG ANSWER
| input |
|---|
| 135
-460235 328576 -145235 553576 -910235 688576 -280235 58576 ... |
| correct output |
|---|
| 98 |
| user output |
|---|
| 80 |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 113
390086 -474936 -59914 -609936 480086 -879936 345086 -204936 ... |
| correct output |
|---|
| 86 |
| user output |
|---|
| 66 |
Test 11
Verdict: WRONG ANSWER
| input |
|---|
| 1921
221773 -175524 -75227 -72024 -75227 -72023 527773 -22524 ... |
| correct output |
|---|
| 1866 |
| user output |
|---|
| 1801 |
Test 12
Verdict: WRONG ANSWER
| input |
|---|
| 1960
-166870 -301876 4130 -45376 4129 -45376 4130 -45377 ... |
| correct output |
|---|
| 1891 |
| user output |
|---|
| 1832 |
Test 13
Verdict: WRONG ANSWER
| input |
|---|
| 1983
490468 217759 85468 357259 791968 631759 76468 150259 ... |
| correct output |
|---|
| 1917 |
| user output |
|---|
| 1862 |
Test 14
Verdict: WRONG ANSWER
| input |
|---|
| 1910
75208 56523 340708 452523 340708 452522 -356792 430023 ... |
| correct output |
|---|
| 1863 |
| user output |
|---|
| 1818 |
Test 15
Verdict: WRONG ANSWER
| input |
|---|
| 1984
-178901 -113059 -381401 12941 -381400 12941 -381401 12940 ... |
| correct output |
|---|
| 1932 |
| user output |
|---|
| 1889 |
Test 16
Verdict: ACCEPTED
| input |
|---|
| 2000
-318296 48998 -322618 47556 -335584 43230 -300516 32354 ... |
| correct output |
|---|
| 1794 |
| user output |
|---|
| 1794 |
Test 17
Verdict: ACCEPTED
| input |
|---|
| 2000
-376251 158360 -373641 158980 -386177 169482 -387909 155698 ... |
| correct output |
|---|
| 1796 |
| user output |
|---|
| 1796 |
Test 18
Verdict: ACCEPTED
| input |
|---|
| 2000
4141 -447930 22987 -450556 22988 -450556 8931 -452688 ... |
| correct output |
|---|
| 1797 |
| user output |
|---|
| 1797 |
Test 19
Verdict: ACCEPTED
| input |
|---|
| 2000
-83018 -8575 -84778 -5615 -84778 -5616 -84778 -5614 ... |
| correct output |
|---|
| 1819 |
| user output |
|---|
| 1819 |
Test 20
Verdict: ACCEPTED
| input |
|---|
| 2000
-199417 -261684 -204449 -244760 -219545 -193988 -183653 -255010 ... |
| correct output |
|---|
| 1803 |
| user output |
|---|
| 1803 |
