제출 #897890

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
897890	2024-01-03 23:39:35	Rainmaker2627	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	245 ms	275420 KiB

shoes

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#include "shoes.h"
using namespace std;
struct segtree {
  int n;
  vector<int> st;
  segtree(int a) {
    n=a;
    while (n&(n-1)) n++;
    vector<int> b(2*n);
    swap(b, st);
  }
  int query(int ql, int qr, int v=1, int nl=1, int nr=-1) {
    if (nr==-1) { nr=this->n; ql++; qr++; }
    if (ql>nr || qr<nl) return 0;
    if (ql<=nl && qr>=nr) return st[v];
    return query(ql, qr, 2*v, nl, (nl+nr)/2) + query(ql, qr, 2*v+1, (nl+nr)/2+1, nr);
  }
  void update(int p) {
    for (p+=n; p>0; p/=2) st[p]++;
  }
  int operator[](int a) { return st[a+n]; }
};
long long count_swaps(vector<int> s) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 15 / 15