oj.uz

Submission #990769

# Submission time Handle Problem Language Result Execution time Memory
990769 2024-05-31T09:03:31 Z xnqs Lost Array (NOI19_lostarray) C++17
100 / 100
 24 ms 4036 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <tuple>

int x, q;
int ret[100005];

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	std::cout.tie(NULL);

	std::cin >> x >> q;
	for (int i = 0; i < x; i++) {
		ret[i] = 1000000000;
	}

	std::vector<std::tuple<int,int,int>> queries;
	for (int i = 0, a, b, c; i < q; i++) {
		std::cin >> a >> b >> c; --a, --b;
		queries.emplace_back(a,b,c);
	}

	std::sort(queries.begin(),queries.end(),[](const std::tuple<int,int,int>& a, const std::tuple<int,int,int>& b) {
		return std::get<2>(a) < std::get<2>(b);
	});

	for (const auto& [a, b, c] : queries) {
		ret[a] = ret[b] = c;
	}
	for (int i = 0; i < x; i++) {
		std::cout << ret[i] << " ";
	}
	std::cout << "\n";
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 6 ms 1628 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 6 ms 1628 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1052 KB Output is correct
2 Correct 7 ms 1624 KB Output is correct
3 Correct 6 ms 1620 KB Output is correct
4 Correct 4 ms 1052 KB Output is correct
5 Correct 1 ms 568 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 6 ms 1628 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 5 ms 1372 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1052 KB Output is correct
17 Correct 7 ms 1624 KB Output is correct
18 Correct 6 ms 1620 KB Output is correct
19 Correct 4 ms 1052 KB Output is correct
20 Correct 1 ms 568 KB Output is correct
21 Correct 12 ms 2132 KB Output is correct
22 Correct 14 ms 2260 KB Output is correct
23 Correct 16 ms 3280 KB Output is correct
24 Correct 15 ms 2768 KB Output is correct
25 Correct 24 ms 4036 KB Output is correct