CSES - IZhO 2017, day 2

CSES - IZhO 2017, day 2 - Results

Submission details
Task:	Simple game
Sender:	Yytsi
Submission time:	2019-02-05 13:59:44 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	22
#2	ACCEPTED	27
#3	ACCEPTED	51

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1, 3	details
#2	ACCEPTED	0.02 s	1, 3	details
#3	ACCEPTED	0.03 s	1, 3	details
#4	ACCEPTED	0.02 s	1, 3	details
#5	ACCEPTED	0.02 s	1, 3	details
#6	ACCEPTED	0.03 s	1, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.07 s	2, 3	details
#9	ACCEPTED	0.07 s	2, 3	details
#10	ACCEPTED	0.08 s	2, 3	details
#11	ACCEPTED	0.07 s	2, 3	details
#12	ACCEPTED	0.07 s	2, 3	details
#13	ACCEPTED	0.10 s	3	details
#14	ACCEPTED	0.10 s	3	details
#15	ACCEPTED	0.10 s	3	details
#16	ACCEPTED	0.09 s	3	details
#17	ACCEPTED	0.10 s	3	details
#18	ACCEPTED	0.07 s	2, 3	details

Code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define IO ios_base::sync_with_stdio(0); cin.tie(0)
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
#define N 1010101
int n, m;
int bit[N];
int v[N];
 
void add(int k, int x) {
  for (; k <= N; bit[k] += x, k += k & -k);
}
 
void add_seg(int a, int b, int x) {
  if (b < a) swap(a, b);
  add(a, x);
  add(b+1, -x);
}
 
int upto(int k) {
  int s = 0;
  for (; k >= 1; s += bit[k], k -= k & -k);
  return s;
}
 
int main() {
  IO; cin>>n>>m;
  FOR(i,1,n+1) cin>>v[i];
  FOR(i,1,n) add_seg(v[i], v[i+1], 1);
 
  FOR(i,0,m) {
    int t; cin>>t;
    if (t == 1) {
      int k, x; cin>>k>>x;
      if (n == 1) {
        v[k] = x;
      } else if (k == 1) {
        // | C X ...
        // Affects only C -> X
        add_seg(v[1], v[2], -1);
        v[1] = x;
        add_seg(v[1], v[2], 1);
      } else if (k == n) {
        // ... X C |
        // Affects only X -> C
        add_seg(v[n-1], v[n], -1);
        v[n] = x;
        add_seg(v[n-1], v[n], 1);
      } else {
        // ... X1 C X2 ...
        // Update X1 <-> C
        add_seg(v[k-1], v[k], -1);
        add_seg(v[k-1], x, 1);
 
        // Update C <-> X2
        add_seg(v[k], v[k+1], -1);
        add_seg(x, v[k+1], 1);
        v[k] = x;
      }
    } else {
      int h; cin>>h;
      cout<<upto(h)<<"\n";
    }
  }
}

Test details

Test 1

Group: 1, 3

Verdict: ACCEPTED

input
`3 3 1 5 1 2 3 1 1 5 2 3` view save

correct output
`2 1` view save

user output
`2 1` view save

Test 2

Group: 1, 3

Verdict: ACCEPTED

input
`1000 1000 403944 539844 451514 488113 69...` view save

correct output
`444 462 34 516 288 ...` view save

user output
`444 462 34 516 288 ...` Truncated

Test 3

Group: 1, 3

Verdict: ACCEPTED

input
`1000 1000 487368 55984 456259 117591 818...` view save

correct output
`440 400 480 130 38 ...` view save

user output
`440 400 480 130 38 ...` Truncated

Test 4

Group: 1, 3

Verdict: ACCEPTED

input
`1000 1000 570792 604828 236813 971260 13...` view save

correct output
`386 460 50 470 126 ...` view save

user output
`386 460 50 470 126 ...` Truncated

Test 5

Group: 1, 3

Verdict: ACCEPTED

input
`1000 1000 686920 120969 241559 600738 48...` view save

correct output
`330 306 418 290 136 ...` view save

user output
`330 306 418 290 136 ...` Truncated

Test 6

Group: 1, 3

Verdict: ACCEPTED

input
`1000 1000 737640 478325 54816 262919 609...` view save

correct output
`230 418 148 338 4 ...` view save

user output
`230 418 148 338 4 ...` Truncated

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1000 1000 1 1000000 1 1000000 1 1000000 ...` view save

correct output
`999 999 999 999 999 ...` view save

user output
`999 999 999 999 999 ...` Truncated

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`100000 100000 18 15 8 5 7 19 19 11 11 8 6 15...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` Truncated

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`100000 100000 611680 625326 848926 304761 34...` view save

correct output
`30636 30745 50130 4464 9086 ...` view save

user output
`30636 30745 50130 4464 9086 ...` Truncated

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`100000 100000 695104 174171 853672 901534 35...` view save

correct output
`31870 39772 30788 11144 42732 ...` view save

user output
`31870 39772 30788 11144 42732 ...` Truncated

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
`100000 100000 1 1 1 2 1 1 2 1 2 2 1 2 2 1 1 ...` view save

correct output
`0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 ...` Truncated

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
`100000 100000 2845 22894 4105 11830 29440 21...` view save

correct output
`45066 50090 24109 27778 294 ...` view save

user output
`45066 50090 24109 27778 294 ...` Truncated

Test 13

Group: 3

Verdict: ACCEPTED

input
`100000 100000 123269 247698 241557 639404 38...` view save

correct output
`37412 1520 46224 964 50058 ...` view save

user output
`37412 1520 46224 964 50058 ...` Truncated

Test 14

Group: 3

Verdict: ACCEPTED

input
`100000 100000 206693 572351 22110 493074 737...` view save

correct output
`33086 49042 43971 17756 41889 ...` view save

user output
`33086 49042 43971 17756 41889 ...` Truncated

Test 15

Group: 3

Verdict: ACCEPTED

input
`100000 100000 322821 121195 59560 155256 829...` view save

correct output
`28252 45031 28212 6208 31642 ...` view save

user output
`28252 45031 28212 6208 31642 ...` Truncated

Test 16

Group: 3

Verdict: ACCEPTED

input
`100000 100000 438949 637336 872818 784733 17...` view save

correct output
`45374 22320 9690 5630 40012 ...` view save

user output
`45374 22320 9690 5630 40012 ...` Truncated

Test 17

Group: 3

Verdict: ACCEPTED

input
`100000 100000 489669 186180 653371 446915 52...` view save

correct output
`43104 43128 41430 35554 996 ...` view save

user output
`43104 43128 41430 35554 996 ...` Truncated

Test 18

Group: 2, 3

Verdict: ACCEPTED

input
`100000 100000 1 1000000 1 1000000 1 1000000 ...` view save

correct output
`99999 99999 99999 99999 99999 ...` view save

user output
`99999 99999 99999 99999 99999 ...` Truncated

IZhO 2017, day 2

Simple game

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Tasks

Submissions (Yytsi)