Why the second code executes within 500ms whereas the first one gives TLE(2000ms) ?
1497E1 - Square-Free Division (easy version)
const int N = 1e7 + 5;
vector<int> maping(N);
int i,j;
Code 1
Code 2
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Why the second code executes within 500ms whereas the first one gives TLE(2000ms) ?
1497E1 - Square-Free Division (easy version)
const int N = 1e7 + 5;
vector<int> maping(N);
int i,j;
for (i = 1; i < N; i++) {
maping[i] = i;
}
for (i = 2; i < N; i++) {
for (j = 2; j * j <= i; j++) {
while (maping[i] % (j * j) == 0) maping[i] = maping[i] / (j * j);
}
}
for (i = 1 ; i < N ; i++) maping[i] = i;
for (i = 2; i < N; i++) {
for (j = i * i; j <= N; j += i * i) {
while (maping[j] % (i * i) == 0) {
maping[j] = maping[j] / (i * i);
}
}
}
Название |
---|