제출 #1144470

#제출 시각아이디문제언어결과실행 시간메모리
1144470zhasynArranging Shoes (IOI19_shoes)C++20
10 / 100
12 ms1860 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 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...