# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
444037 | 2021-07-13T03:44:10 Z | Petremol | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include "bubblesort2.h" #define int int64_t #define all(x) x.begin(), x.end() #define send ios_base::sync_with_stdio(false); #define help cin.tie(NULL) #define inf (int)(1e17+1) #define mod (int)(1e9+7) #define N (int)(2e5+5) #define fi first #define se second #define endl "\n" #define eps (double)(1e-9) #define sa cout<<"sa"<<endl using namespace std; vector<int> countScans(vector<int> v,vector<int> p,vector<int> x){ //int n=v.size(); int q=x.size(); vector<int> ans(q); return ans; }