# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1158887 | vladilius | Railway Trip (JOI17_railway_trip) | C++20 | 484 ms | 59404 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, q; cin>>n>>k>>q;
vector<int> a(n + 1), d[k + 1];
for (int i = 1; i <= n; i++){
cin>>a[i];
d[a[i]].pb(i);
}
vector<int> g[n + 1];
set<int> st;
for (int i = k; i > 0; i--){
for (int j: d[i]) st.insert(j);
for (int j: d[i]){
auto it = st.find(j);
if (it != prev(st.end())){
auto it1 = next(it);
g[j].pb(*it1);
g[*it1].pb(j);
# | 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... |