| Task: | Lantern Line |
| Sender: | ollpu_kilo |
| Submission time: | 2018-09-13 18:59:52 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | TIME LIMIT EXCEEDED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | details |
| #2 | ACCEPTED | 0.02 s | details |
| #3 | ACCEPTED | 0.68 s | details |
| #4 | TIME LIMIT EXCEEDED | -- | details |
| #5 | TIME LIMIT EXCEEDED | -- | details |
| #6 | TIME LIMIT EXCEEDED | -- | details |
| #7 | TIME LIMIT EXCEEDED | -- | details |
| #8 | TIME LIMIT EXCEEDED | -- | details |
| #9 | TIME LIMIT EXCEEDED | -- | details |
| #10 | TIME LIMIT EXCEEDED | -- | details |
| #11 | TIME LIMIT EXCEEDED | -- | details |
| #12 | TIME LIMIT EXCEEDED | -- | details |
| #13 | TIME LIMIT EXCEEDED | -- | details |
| #14 | TIME LIMIT EXCEEDED | -- | details |
| #15 | TIME LIMIT EXCEEDED | -- | details |
Code
#pragma GCC optimize ("O3")
#pragma GCC target ("arch=skylake")
#include <bits/stdc++.h>
using namespace std;
const int N = 2*100000;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
bitset<N> x, m;
for (int i = 0; i < n; ++i) m[i] = 1;
x[0] = 1;
int res[n];
for (int i = 0; i < n; ++i) {
res[i] = x.count();
x = (x<<1 ^ x<<2)&m;
}
for (int i = 0; i < n; ++i) {
cout << res[i] << " ";
}
cout << endl;
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 6 |
| correct output |
|---|
| 1 2 2 3 1 1 |
| user output |
|---|
| 1 2 2 3 1 1 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 50000 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... Truncated |
Test 4
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 5
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 300000 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 7
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 400000 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 8
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 345283 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 9
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 283161 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 10
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 269247 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 11
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 392224 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 12
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 398314 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 13
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 397155 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 14
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 393692 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
Test 15
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 398499 |
| correct output |
|---|
| 1 2 2 4 2 4 4 8 2 4 4 8 4 8 8 ... |
| user output |
|---|
| (empty) |
