Task: | Final Array |
Sender: | bits pls |
Submission time: | 2019-05-25 14:59:38 +0300 |
Language: | C++ |
Status: | READY |
Result: | TIME LIMIT EXCEEDED |
test | verdict | time | |
---|---|---|---|
#1 | TIME LIMIT EXCEEDED | -- | details |
#2 | TIME LIMIT EXCEEDED | -- | details |
#3 | ACCEPTED | 0.02 s | details |
Code
#include <iostream> using namespace std; int main() { long* arr = new long[100001]; int n, m; cin >> n; cin >> m; for (int i = 0; i < m; i++) { int a, b; long x; cin >> a; cin >> b; cin >> x; for (int k = 0; k <= b - a; k += 1) { if (arr[a+k-1] < x) arr[a+k-1] = x; x += 1; } } for (int i = 0; i < n; i++) { cout << arr[i]; if (i != n - 1) cout << " "; } return 0; }
Test details
Test 1
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 29706 39977 913671103 20575 89990 878449866 1691 70785 229168045 81099 81323 611730238 ... |
correct output |
---|
227121122 450258482 450258483 ... |
user output |
---|
(empty) |
Test 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 100000 1 100000 1 1 100000 2 1 100000 3 1 100000 4 ... |
correct output |
---|
100000 100001 100002 100003 10... |
user output |
---|
(empty) |
Test 3
Verdict: ACCEPTED
input |
---|
8 2 1 4 1 1 8 1 |
correct output |
---|
1 2 3 4 5 6 7 8 |
user output |
---|
1 2 3 4 5 6 7 8 |