# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174468 | Pacybwoah | DEL13 (info1cup18_del13) | C++20 | 2 ms | 580 KiB |
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<cmath>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while(t--){
int n, k;
cin >> n >> k;
vector<pair<int, pair<int, int>>> rngs;
vector<int> vec(n + 1);
for(int i = 0; i < k; i++){
int tmp;
cin >> tmp;
vec[tmp] = 1;
}
int lst = 1;
for(int i = 2; i <= n; i++){
if(vec[i - 1] != vec[i]){
rngs.emplace_back(vec[i - 1], make_pair(lst, i - 1));
lst = i;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |