| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1144470 | zhasyn | Arranging Shoes (IOI19_shoes) | C++20 | 12 ms | 1860 KiB |
#include "shoes.h"
using namespace std;
#define ll long long
const ll N = 1e5 + 100;
ll fen[N];
void upd(int i, int delta){
for(; i < N; i |= (i + 1)){
fen[i] += delta;
}
}
ll get(ll r){
ll res = 0;
for(; r >= 0; r = (r &(r + 1)) - 1){
res += fen[r];
}
return res;
}
long long count_swaps(std::vector<int> s) {
if(s[1]<0) return 1;
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
