Submission #1176552

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1176552	2025-03-31 11:46:48	vicvic	Vudu (COCI15_vudu)	C++20	140 / 140	666 ms	64508 KiB

vudu

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 <iostream>
#include <map>
#include <fstream>
#include <unordered_map>
#include <algorithm>
#include <cstdint>
#include <vector>
#define int long long
using namespace std;
const int NMAX=1e6;
int v[NMAX+5], sp[NMAX+5], n, p;
vector <int> vals;
class SegTree
{
public:
    int t[8*NMAX+5];
    void actupdate (int nod, int st, int dr, int poz, int val)
    {
        if (st==dr)
        {
            t[nod]++;
        }
        else
        {
            int mij = (st+dr) >> 1;
            if (poz<=mij)
                actupdate (nod*2, st, mij, poz, val);
            else actupdate (nod*2+1, mij+1, dr, poz, val);
            t[nod]=t[nod*2]+t[nod*2+1];
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 140 / 140