Can someone explain to me why did I get MLE? 580C - Кефа и парк MLE : 216547229 AC : 216548333
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can someone explain to me why did I get MLE? 580C - Кефа и парк MLE : 216547229 AC : 216548333
Need help figuring out why this code is getting TLE. Problem link : 1829D - Gold Rush
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.
Name |
---|