제출 #1067877

#제출 시각아이디문제언어결과실행 시간메모리
1067877pccArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms348 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; #define pii pair<int,int> #define fs first #define sc second const int mxn = 2e5+10; int pos[mxn],tar[mxn]; int arr[mxn]; int N; map<int,int> pre; long long count_swaps(std::vector<int> s) { N = s.size(); for(int i = 0;i<N;i++)arr[i] = s[i]; if(arr[0]>0)return 1; else return 0; }
#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...