oj.uz

답안 #386780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
386780 2021-04-07T09:45:57 Z clifter 가로등 (APIO19_street_lamps) C++14
20 / 100
 5000 ms 52668 KB 
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#define ll long long

using namespace std;
struct event{
  int t; int x; int y; ll value;
};
bool cmpt(event a, event b){return a.t<b.t;}
bool cmpx(event a, event b){if(a.x!=b.x) return a.x<b.x; else return a.t<b.t;}

int last[300500],first[300500],toggle[300500];
ll ans[300500];
ll fw1[300500], fw2[300500];
set<int> S;
event EA[300500][4],EB[1005000], EA0[1005000];
int Asize[300500],EA0size;


void cdq(int l, int r, int n){

  int mid = (l+r)/2;
  if(l==r) return;

  cdq(l, mid, n);
  cdq(mid+1, r, n);

  int EBS = 0;

  for(int i=l; i<=r; i++){

    if(i==0) {
      for(int j=0; j<EA0size; j++){
        EB[EBS++] = EA0[j];
      }
    }

    else{
      for(int j=0; j<Asize[i]; j++){
        EB[EBS++] = EA[i][j];
      }
    }

  }

  sort(EB, EB+EBS, cmpx);

  for(int i=0; i<=n+1; i++) {fw1[i] = 0; fw2[i] = 0;}
  for(int i=0; i<EBS; i++){

    if(EB[i].t<=mid&&EB[i].value!=0){

      int x = n+2-EB[i].y;
      while(x < n+2) {
        fw1[x] += EB[i].value*EB[i].t;
        fw2[x] += EB[i].value;
        x += (x & -x);
      }

    }

    if(EB[i].t>mid&&EB[i].value==0) {
      
      int x = n+2-EB[i].y;
      while (x > 0) {

        ans[EB[i].t] += fw2[x]*EB[i].t;
        ans[EB[i].t] -= fw1[x];
        x -= (x & -x);

      }
    }
  }

}

int main() {


  cin.sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);

  int n, m;
  cin>>n>>m;

  string s;
  cin>>s;


  last[n+1] = n+1;
  first[1] = 1;
  for(int i=n+1; i>=2; i--) last[i-1] = (s[i-2]=='1')?last[i]:(i-1);
  for(int i=2; i<=n+1; i++) first[i] = (s[i-2]=='1')?first[i-1]:i;
  S.insert(n+1);
  for(int i=1; i<=n; i++) if(s[i-1]=='0') S.insert(i); 

  for(int i=1; i<=n+1; i++){

    if(last[i]==i){

      event e = {0, first[i], i, 1};
      if(first[i]!=i) EA0[EA0size++] = e;

    }
  }

  for(int i=1; i<=m; i++){

    string v;
    cin>>v;

    if(v=="query"){

      int x, y;
      cin>>x>>y;
      event e = {i, x, y, 0};
      EA[i][Asize[i]++] = e;
      toggle[i] = 1;

    }
    else{

      int a;
      event e1, e2, e3;
      cin>>a;
      if(s[a-1]=='0'){

        s[a-1]='1';

        e1 = {i, a+1, last[a+1], -1};
        e2 = {i, first[a], last[a+1], 1};
        e3 = {i, first[a], a, -1};


        last[first[a]] = last[a+1];
        first[last[a+1]] = first[a];

        auto k = S.find(a);
        S.erase(k);

      }
      else{

        s[a-1] = '0';
        int x1, x2;
        x2 = *S.lower_bound(a+1);
        x1 = first[x2];

        e1 = {i, x1, x2, -1};
        e2 = {i, x1, a, 1};
        e3 = {i, a+1, x2, 1};


        last[x1] = a;
        last[a+1] = x2;
        first[a] = x1;
        first[x2] = a+1;
        S.insert(a);

      }

      if(e1.x!=e1.y) EA[i][Asize[i]++] = e1;
      if(e2.x!=e2.y) EA[i][Asize[i]++] = e2;
      if(e3.x!=e3.y) EA[i][Asize[i]++] = e3;
    
    }
  }

  cdq(0, m, n);
  for(int i=1; i<=m; i++){

    if(toggle[i]==1) cout<<ans[i]<<"\n";

  }
  
  
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1248 ms 44836 KB Output is correct
2 Correct 1347 ms 44780 KB Output is correct
3 Correct 2842 ms 45120 KB Output is correct
4 Execution timed out 5073 ms 49736 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 620 KB Output is correct
2 Correct 5 ms 620 KB Output is correct
3 Correct 5 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Execution timed out 5097 ms 52668 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 620 KB Output is correct
2 Correct 4 ms 620 KB Output is correct
3 Correct 4 ms 620 KB Output is correct
4 Correct 5 ms 620 KB Output is correct
5 Execution timed out 5048 ms 49384 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1248 ms 44836 KB Output is correct
9 Correct 1347 ms 44780 KB Output is correct
10 Correct 2842 ms 45120 KB Output is correct
11 Execution timed out 5073 ms 49736 KB Time limit exceeded
12 Halted 0 ms 0 KB -