Submission #583464

#TimeUsernameProblemLanguageResultExecution timeMemory
583464lcjArranging Shoes (IOI19_shoes)C++17
10 / 100
1 ms296 KiB
#include <bits/stdc++.h> #define LSOne(s) ((s) & -(s)) using namespace std; typedef long long ll; typedef pair<ll, ll> pll; typedef pair<int, int> pii; struct FenwickTree { vector<ll> ft; FenwickTree(int n) : ft(n+1) {} ll rsq(int i) { ll su = 0; for (; i > 0; i -= LSOne(i)) { su += ft[i]; } } ll rsq(int i, int j) { return rsq(j)-rsq(i-1); } void update(int i, int dv) { for (; i < (int)ft.size(); i += LSOne(i)) { ft[i] += dv; } } }; ll count_swaps(std::vector<int> s) { return !(s[0] < s[1]); }

Compilation message (stderr)

shoes.cpp: In member function 'll FenwickTree::rsq(int)':
shoes.cpp:18:5: warning: no return statement in function returning non-void [-Wreturn-type]
   18 |     }
      |     ^
#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...