제출 #143894

#제출 시각아이디문제언어결과실행 시간메모리
143894RezwanArefin01Arranging Shoes (IOI19_shoes)C++17
0 / 100
275 ms269724 KiB
#include <bits/stdc++.h> #include "shoes.h" using namespace std; const int N = 2e5 + 10; deque<int> pos[2][N]; int r[N], bit[N]; void update(int x) { for(++x; x > 0; x -= x & -x) ++bit[x]; } int read(int x) { int ret = 0; for(++x; x < N; x += x & -x) ret += bit[x]; return ret; } long long count_swaps(vector<int> s) { vector<int> ord; for(int i = 0; i < s.size(); ++i) { int x = abs(s[i]), c = s[i] > 0; if(pos[c ^ 1][x].size()) { int j = pos[c ^ 1][x].front(); pos[c ^ 1][x].pop_front(); r[j] = i; } else { pos[c][x].push_back(i); ord.push_back(i); } } exit(0); long long ans = 0; for(int i : ord) { int L = i + read(i); int R = r[i] + read(r[i]); ans += R - L - 1 + (s[i] > 0); update(R); } return ans; }

컴파일 시 표준 에러 (stderr) 메시지

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:25:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < s.size(); ++i) {
                    ~~^~~~~~~~~~
#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...