这个复杂度会超时吗
by tangrunxi @ 2022-07-15 19:35:19
用更高效的读入?(如 scanf 或快读)
by zzq_666 @ 2022-07-15 19:44:58
@[zzq_666](/user/571841) 我感觉楼主问题不在这里,他这 $O(m)$ 的复杂度不会超时吧。不过他这TLE就很离谱了。
by tangrunxi @ 2022-07-15 19:47:14
是 RE 说清楚点,不是超时,超时是 TLE
by AKNOI的梓钦 @ 2022-07-15 19:49:32
注意有 $a_i=0$ 的情况
by AKNOI的梓钦 @ 2022-07-15 19:51:23
@[tangrunxi](/user/231147)
by AKNOI的梓钦 @ 2022-07-15 19:51:30
@[AKNOI的梓钦](/user/479246) 草,您别at我啊,我只是参与讨论一下,您直接at楼主。
by tangrunxi @ 2022-07-15 19:54:12
@[tangrunxi](/user/231147) at 错认了,报意思
by AKNOI的梓钦 @ 2022-07-15 19:56:02
@[lizhuoqun](/user/528548)
by AKNOI的梓钦 @ 2022-07-15 19:56:11
```cpp
#include<bits/stdc++.h>改好了
using namespace std;
long long n,m,k,a[110000],b[110000],i,t;
bool f;
int main()
{
cin>>k>>m>>n;
for(i=1;i<=m;i++)
{
cin>>a[i]>>b[i];
if(a[i]==0&&b[i]!=0)
{
cout<<i<<' ';
f=1;
continue;
}
if(k<a[i])continue;
t=k/a[i];
if(t*b[i]>=n)
{
cout<<i<<' ';
f=1;
}
}
if(f==0)cout<<-1;
return 0;
}
```
by FanSizhe127 @ 2022-08-13 10:50:49