QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #240782 | #6348. Egor Has a Problem | ylf# | WA | 174ms | 7384kb | C++14 | 728b | 2023-11-05 18:50:57 | 2023-11-05 18:50:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=500100;
ll n,a[N];
int main()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
if(n<=70)
{
for(int i=1;i<n;i++)
for(int j=i+1;j<n;j++)
for(int k=j+1;k<n;k++)
for(int l=k+1;l<=n;l++)
if(a[j]/a[i]==a[l]/a[k])
{
cout<<"YES\n"<<i<<" "<<j<<" "<<k<<" "<<l;
return 0;
}
cout<<"NO";
return 0;
}
cout<<"YES\n";
int i=2;
for(int i=2;i<=n;i++)
{
if(a[i]/a[i-1]==1ll)
{
cout<<i-1<<" "<<i<<" ";
break;
}
}
i++;
for(;i<=n;i++)
{
if(a[i]/a[i-1]==1ll)
{
cout<<i-1<<" "<<i;
break;
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3360kb
input:
6 2 6 11 21 47 120
output:
YES 1 3 4 6
result:
ok OK
Test #2:
score: 0
Accepted
time: 1ms
memory: 3324kb
input:
5 1 2 6 30 210
output:
NO
result:
ok OK
Test #3:
score: 0
Accepted
time: 0ms
memory: 3392kb
input:
4 7 13 77 143
output:
YES 1 2 3 4
result:
ok OK
Test #4:
score: 0
Accepted
time: 0ms
memory: 3268kb
input:
4 10 29 31 100
output:
NO
result:
ok OK
Test #5:
score: -100
Wrong Answer
time: 174ms
memory: 7384kb
input:
500000 627045176858 4817409059014 6288122580263 11138485427254 14292718094002 14799874839768 16926890883539 17617152313162 17645472255619 18208915248631 22963632241827 24466999302606 25551903318615 26091633648017 38200644379849 39885775205129 40036378248650 40309675851194 40773414900416 408933438176...
output:
YES 2 3 2 3
result:
wrong answer 4 indices should be in increasing order