QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#364050 | #2838. 2D Geometry | x_jw# | WA | 0ms | 3624kb | C++14 | 874b | 2024-03-24 10:57:39 | 2024-03-24 10:57:41 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using db=double;
#define int long long
using pii=pair<int,int>;
#define endl "\n"
#define pb push_back
void solve(int n)
{
vector<pii>pic;
for(int i=0;i<n;i++)
{
int x,y;
cin>>x>>y;
pic.pb({x,y});
}
if(n<3)
{
cout<<n<<endl;
return;
}
int x1=pic[0].first-pic[1].first;
int y1=pic[0].second-pic[1].second;
for(int i=2;i<n;i++)
{
int x=pic[i].first-pic[1].first;
int y=pic[i].second-pic[1].second;
if(1ll*x*y1==1ll*y*x1) continue;
else {cout<<0<<endl;return;}
}
cout<<n<<endl;
}
signed main()
{
#ifdef ONLINE_JUDGE
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
#endif
int _=1;
while(cin>>_) solve(_);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
input:
3 0 0 0 1 0 2 3 0 0 0 1 1 0 6 0 0 0 1 0 2 0 3 1 1 1 2
output:
3 0 0
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3624kb
input:
1 0 0 2 0 0 1 1 3 0 0 0 1 0 2 3 0 0 0 1 1 0 4 3 0 0 2 3 3 3 1 4 2 3 1 1 0 3 0 2 4 0 0 0 3 0 2 0 1 5 8 6 9 2 2 3 7 4 1 5 5 2 2 4 2 6 2 7 2 0 4 5 3 7 5 4 4 4 9 4 9 9 5 5 4 5 9 5 5 4 3 1 0 5 3 2 1 2 7 2 6 2 5 2 6 7 2 7 9 0 3 8 8 4 4 3 8 6 2 8 2 5 3 5 3 8 2 0 0 2 6 2 3 8 4 2 9 2 2 2 6 4 9 6 2 1 7 6 6 5 ...
output:
1 2 3 0 0 0 4 0 0 0 0 5 0 0 0 0 0 0 0 0 0 6
result:
wrong answer 5th lines differ - expected: '1', found: '0'