QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #386536 | #3769. 共线点 | ucup-team1251 | AC ✓ | 10ms | 3752kb | C++17 | 601b | 2024-04-11 18:01:47 | 2024-04-11 18:01:47 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
// #define int long long
// const int N=1e6+9;
// string s;
double a1,a2,a3,b1,b2,b3,y,yy,yyy;
void solve()
{
while(cin>>a1>>b1>>y)
{
cin>>a2>>b2>>yy;
cin>>a3>>b3>>yyy;
double x=a1+(yyy-y)*(a1-b2)/(y-yy);
double xx=b1+(yyy-y)*(b1-a2)/(y-yy);
if(a3>x||b3<xx)
{
cout<<"No"<<'\n';
}else
{
cout<<"Yes"<<"\n";
}
}
}
int main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T=1;
// cin>>T;
while(T--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 10ms
memory: 3752kb
input:
0 1 0 0 1 1 0 1 2 0 1 0 1 2 1 0 1 2 0 1 0 2 3 1 0 1 2 3 8 2 5 7 4 2 8 7 2 7 1 1 3 3 0 8 4 4 6 1 1 3 3 2 9 4 0 9 1 0 3 6 2 9 9 0 6 3 4 6 5 1 2 7 6 9 4 4 7 6 1 8 9 0 6 5 0 6 6 0 8 7 4 7 2 6 8 4 2 5 8 5 6 1 6 9 2 1 5 9 3 5 1 2 8 2 3 4 6 5 8 2 1 6 3 8 9 7 1 7 2 4 7 6 2 9 9 5 6 3 0 7 5 2 4 8 0 3 1 2 9 3 ...
output:
Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes Yes No No Yes Yes No Yes Yes No Yes Yes Yes Yes Yes No Yes Yes No Yes No Yes Yes Yes Yes Yes Yes No Yes Y...
result:
ok 10000 lines