QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#784222 | #8209. Curly Palindromes | rotcar07 | WA | 0ms | 3696kb | C++23 | 495b | 2024-11-26 14:09:44 | 2024-11-26 14:09:46 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
constexpr int N=105;
int x[N],y[N];char c[N];
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>x[i]>>y[i]>>c[i];
if(n<3) return cout<<n<<'\n',0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)if(i!=j)
for(int k=1;k<=n;k++)if(i!=k&&j!=k&&c[i]==c[k]){
if(1ll*(x[j]-x[i])*(y[k]-y[j])>1ll*(y[j]-y[i])*(x[k]-x[j])){
cout<<"infinity\n";
return 0;
}
}
cout<<"2\n";
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3696kb
input:
4 0 0 o 1 1 c 2 2 p 3 3 c
output:
2
result:
ok single line: '2'
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3508kb
input:
3 2 3 e 3 2 e 8 9 e
output:
infinity
result:
wrong answer 1st lines differ - expected: 'Infinity', found: 'infinity'