Submission #842682

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
842682	2023-09-03 08:38:53	TheLostCookie	Soccer Stadium (IOI23_soccer)	C++17	100 / 100	3496 ms	1448532 KiB

soccer

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 "soccer.h"
#include <tuple>
struct SparseTable {
  std::vector<std::vector<int>> t;
  SparseTable(std::vector<int> v) {
    int n = v.size();
    int lg = (n==1?1:(32-__builtin_clz(n-1)));
    t.push_back(v);
    t.resize(lg+1);
    for(int i = 1; i <= lg; i++) {
      t[i].resize(n);
      for(int j = 0; j <= n-(1<<i); j++) {
        t[i][j] = std::max(t[i-1][j],t[i-1][j+(1<<(i-1))]);
      }
    }
  };
  
  //[l,r)
  int query(int l, int r) {
    if(l+1==r) return t[0][l];
    int lg = (31-__builtin_clz(r-l-1));
    return std::max(t[lg][l],t[lg][r-(1<<lg)]);
  }
};
int biggest_stadium(int N, std::vector<std::vector<int>> F) {
  int R = 1;
  while(4*(R+1)*(R+1) <= N) R++;
  
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 8 / 8
• Subtask 3: 22 / 22
• Subtask 4: 18 / 18
• Subtask 5: 16 / 16
• Subtask 6: 30 / 30