Submission #282489

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
282489	2020-08-24 13:07:06	GREGOIRELC	Arranging Shoes (IOI19_shoes)	C++14	65 / 100	137 ms	71928 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 "shoes.h"
#include <cmath>
#include <iostream>
#include <queue>
using namespace std;
const int MAX_SHOES = 1e5 + 1;
const int T_MAX = 1 << 18;
const int MID = 1 << 17;
int lstType[MAX_SHOES];
int segTree[T_MAX];
queue<int> enCours[MAX_SHOES];
void addVal(int noeud, int deb, int fin, int curDeb, int curFin)
{
  if(curDeb > fin || curFin < deb || curDeb > curFin)
  {
    return;
  }
  if(curDeb >= deb && curFin <= fin)
  {
    segTree[noeud]++;
    return;
  }
  int mid = (curDeb + curFin) / 2;
  addVal(noeud * 2, deb, fin, curDeb, mid);
  addVal(noeud * 2 + 1, deb, fin, mid + 1, curFin);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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