QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #398389 | #3769. 共线点 | Graphcity# | AC ✓ | 8ms | 3624kb | C++20 | 596b | 2024-04-25 11:26:31 | 2024-04-25 11:26:31 |
Judging History
answer
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=2e5;
int a1,b1,x1,a2,b2,x2,a3,b3,x3;
inline void Solve()
{
cin>>a2>>b2>>x2>>a3>>b3>>x3;
double l3=1.0*(a2-b1)/(x2-x1)*(x3-x2)+a2;
double r3=1.0*(b2-a1)/(x2-x1)*(x3-x2)+b2;
double l=max(l3,1.0*a3),r=min(r3,1.0*b3);
if(l<=r) cout<<"Yes"<<endl; else cout<<"No"<<endl;
}
int main()
{
// freopen("1.in","r",stdin);
ios::sync_with_stdio(false);
while(cin>>a1>>b1>>x1) Solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 8ms
memory: 3624kb
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