제출 #1343326

#제출 시각아이디문제언어결과실행 시간메모리
1343326coin_Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
0 / 100
267 ms10068 KiB
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    int n, q;
    cin >> n >> q;
    vector<int> bk(n+1);
    for (int i = 1; i <= n; i++){
        cin >> bk[i];
    }
    while(q--){
        int u, v, k;
        cin >> u >> v >> k;
        // for each query determine whether the largest swap >= k or not
        // sub 3
        cout << 0 << endl;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...