Can someone explain to me why did I get MLE? 580C - Kefa and Park MLE : 216547229 AC : 216548333
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Can someone explain to me why did I get MLE? 580C - Kefa and Park MLE : 216547229 AC : 216548333
Need help figuring out why this code is getting TLE. Problem link : 1829D - Золотая лихорадка
void solve1829D()
{
int n, m, cnt = 0;
cin >> n >> m;
set<int> st;
st.insert(n);
while(st.size() > 0)
{
if(st.find(m) != st.end())
{
cout << "YES" << endl;
return;
}
int x = *st.begin();
st.erase(st.begin());
if(x % 3 == 0) {st.insert(x / 3); st.insert((x * 2) / 3);}
}
cout << "NO" << endl;
}
Can someone help me understand the time complexity of submission #1 and #2? I don't understand why I got TLE on submission #1.
problem link : 1714E - Add Modulo 10
TLE submission #1 : 191420410
TLE submission #2 : 191295823
Thanks for your help.
Название |
---|