제출 #857593

#제출 시각아이디문제언어결과실행 시간메모리
857593sleepntsheepArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms2408 KiB
#include <vector> #include <cstdint> #include <cassert> #include <iostream> #include <algorithm> #define N 200005 int fw[N], posraw[N<<1]; int *pos = posraw+N; void upd(int p, int k) { for (++p; p < N; p+=p&-p) fw[p] += k; } int qry(int p) { if(p<0)return 0;int z = 0; for (++p; p; p-=p&-p) z += fw[p]; return z; } int64_t count_swaps(std::vector<int> v) { int64_t z = 0; int n = v.size() >> 1, f=0; for (int i = 0; i < (int)v.size(); ++i) pos[v[i]] = i; for (int i = 0; i < 2 * n; ++i) { if (qry(i) - qry(i-1) == 1) {continue;} int j = i + (qry(2*n) - qry(i)); z += qry(2*n) - qry(i-1) + qry(2*n) - qry(pos[-v[i]]); upd(pos[-v[i]], 1); if (v[i] > 0) ++z; } return z; } #if 0 int main() { std::cout << count_swaps({1,2,-2,-1}); } #endif

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

shoes.cpp: In function 'int64_t count_swaps(std::vector<int>)':
shoes.cpp:24:13: warning: unused variable 'j' [-Wunused-variable]
   24 |         int j = i + (qry(2*n) - qry(i));
      |             ^
shoes.cpp:18:28: warning: unused variable 'f' [-Wunused-variable]
   18 |     int n = v.size() >> 1, f=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...