Submission #61818563
Source Code Expand
Copy
#include <iostream>#include <vector>using namespace std;int main() {int N;cin >> N;vector<pair<int, int>> contests(N);for (int i = 0; i < N; ++i) {cin >> contests[i].first >> contests[i].second;}int Q;cin >> Q;vector<int> queries(Q);for (int i = 0; i < Q; ++i) {cin >> queries[i];}
#include <iostream> #include <vector> using namespace std; int main() { int N; cin >> N; vector<pair<int, int>> contests(N); for (int i = 0; i < N; ++i) { cin >> contests[i].first >> contests[i].second; } int Q; cin >> Q; vector<int> queries(Q); for (int i = 0; i < Q; ++i) { cin >> queries[i]; } for (int q = 0; q < Q; ++q) { int rating = queries[q]; for (int i = 0; i < N; ++i) { if (rating >= contests[i].first && rating <= contests[i].second) { rating += 1; } } cout << rating << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Rated Range |
User | Baasandorj0327 |
Language | C++ 20 (gcc 12.2) |
Score | 0 |
Code Size | 683 Byte |
Status | TLE |
Exec Time | 2762 ms |
Memory | 6172 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 525 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 3668 KB |
00_sample_01.txt | AC | 1 ms | 3404 KB |
00_sample_02.txt | AC | 1 ms | 3524 KB |
01_test_00.txt | AC | 4 ms | 3488 KB |
01_test_01.txt | AC | 3 ms | 3480 KB |
01_test_02.txt | AC | 1 ms | 3484 KB |
01_test_03.txt | AC | 2 ms | 3524 KB |
01_test_04.txt | TLE | 2759 ms | 4792 KB |
01_test_05.txt | TLE | 2759 ms | 6016 KB |
01_test_06.txt | TLE | 2759 ms | 5176 KB |
01_test_07.txt | TLE | 2759 ms | 6024 KB |
01_test_08.txt | TLE | 2759 ms | 5316 KB |
01_test_09.txt | TLE | 2759 ms | 6172 KB |
01_test_10.txt | TLE | 2759 ms | 4512 KB |
01_test_11.txt | TLE | 2759 ms | 5968 KB |
01_test_12.txt | TLE | 2759 ms | 5140 KB |
01_test_13.txt | TLE | 2759 ms | 6108 KB |
01_test_14.txt | TLE | 2759 ms | 4680 KB |
01_test_15.txt | TLE | 2759 ms | 6012 KB |
01_test_16.txt | AC | 746 ms | 3604 KB |
01_test_17.txt | TLE | 2759 ms | 5964 KB |
01_test_18.txt | TLE | 2759 ms | 5060 KB |
01_test_19.txt | TLE | 2762 ms | 6012 KB |
01_test_20.txt | TLE | 2759 ms | 6112 KB |
01_test_21.txt | TLE | 2759 ms | 6016 KB |
01_test_22.txt | TLE | 2759 ms | 5932 KB |
01_test_23.txt | TLE | 2759 ms | 6036 KB |
01_test_24.txt | TLE | 2759 ms | 6112 KB |
01_test_25.txt | TLE | 2759 ms | 5956 KB |
01_test_26.txt | TLE | 2759 ms | 5984 KB |
01_test_27.txt | TLE | 2759 ms | 5964 KB |
01_test_28.txt | AC | 1 ms | 3464 KB |
01_test_29.txt | AC | 1 ms | 3468 KB |
01_test_30.txt | AC | 1 ms | 3472 KB |
01_test_31.txt | AC | 1 ms | 3400 KB |
01_test_32.txt | AC | 1 ms | 3480 KB |