제출 #1290674

#제출 시각아이디문제언어결과실행 시간메모리
1290674SofiatpcArranging Shoes (IOI19_shoes)C++20
10 / 100
2 ms348 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 1e5+5; vector<int> idl[MAXN], idr[MAXN]; long long count_swaps(vector<int> s) { int n = s.size()/2; for(int i = 0; i < s.size(); i++){ if(s[i] < 0)idl[-s[i]].push_back(i); else idr[s[i]].push_back(i); } long long ans = 0; for(int i = 1; i <= n; i++){ for(int j = 0; j < idl[i].size(); j++){ long long val = 0; if(idr[i][j] > idl[i][j])val = idr[i][j]-idl[i][j]-1; else val = idl[i][j]-idr[i][j]; ans += val; } } return ans; }
#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...