Submission #624936

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
624936	2022-08-09 07:20:05	penguinhacker	Jousting tournament (IOI12_tournament)	C++17	0 / 100	66 ms	19400 KiB

tournament

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>
using namespace std;
#define ll long long
#define ar array
const int mxN=1e5, INF=1e9;
int n, m, ft[mxN], prv[mxN], id[mxN], anc[2*mxN][17], st[mxN][17];
ar<int, 2> seg[2*mxN];
void upd(int i, int x) {
  for (++i; i<=n; i+=i&-i)
    ft[i]+=x;
}
int qry(int k) { // kth 1?
  int x=0;
  for (int i=16; ~i; --i)
    if (x+(1<<i)<=n&&ft[x+(1<<i)]<k)
      k-=ft[x+=1<<i];
  return x;
}
int find(int i) {
  return i^prv[i]?prv[i]=find(prv[i]):i;
}
int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
  n=N, m=C;
  for (int i=0; i<n; ++i) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

tournament.cpp: In function 'int GetBestPosition(int, int, int, int*, int*, int*)':
tournament.cpp:62:39: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   62 |    st[i][j]=max(st[i][j-1], st[i+(1<<j-1)][j-1]);
      |                                      ~^~

• Subtask 1: 0 / 17
• Subtask 2: 0 / 32
• Subtask 3: 0 / 51