oj.uz

Submission #386755

# Submission time Handle Problem Language Result Execution time Memory
386755 2021-04-07T09:21:49 Z clifter Street Lamps (APIO19_street_lamps) C++14
20 / 100
 5000 ms 78692 KB 
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#define ll long long

using namespace std;
class event{

  public:
    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;
vector<event> EA[300500], ER;
ll sum(ll* tree, int i){

  ll ans = 0;
  while (i > 0) {
      ans += tree[i];
      i -= (i & -i);
  }
  return ans;
}
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);

  vector<event> EB;
  for(int i=l; i<=r; i++){
    for(int j=0; j<EA[i].size(); j++){
      EB.push_back(EA[i][j]);
    }
  }

  sort(EB.begin(), EB.end(), cmpx);

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

  for(int i=0; i<EB.size(); i++){

    if(EB[i].t<=mid){

      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) {
      
      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;

  char s[300500];
  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};
      EA[0].push_back(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].push_back(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};
        EA[i].push_back(e1);
        EA[i].push_back(e2);
        EA[i].push_back(e3);

        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};

        EA[i].push_back(e1);
        EA[i].push_back(e2);
        EA[i].push_back(e3);


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

      }
    }
  }

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

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

  }
  
  
}

Compilation message

street_lamps.cpp: In function 'void cdq(int, int, int)':
street_lamps.cpp:42:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int j=0; j<EA[i].size(); j++){
      |                  ~^~~~~~~~~~~~~
street_lamps.cpp:51:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<event>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |   for(int i=0; i<EB.size(); i++){
      |                ~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 7 ms 7532 KB Output is correct
6 Correct 6 ms 7404 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1867 ms 69084 KB Output is correct
2 Correct 1963 ms 69080 KB Output is correct
3 Correct 3465 ms 69356 KB Output is correct
4 Execution timed out 5051 ms 57820 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 7892 KB Output is correct
2 Correct 12 ms 7788 KB Output is correct
3 Correct 12 ms 7660 KB Output is correct
4 Correct 10 ms 7532 KB Output is correct
5 Execution timed out 5060 ms 78692 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7788 KB Output is correct
2 Correct 10 ms 7660 KB Output is correct
3 Correct 14 ms 7788 KB Output is correct
4 Correct 12 ms 7788 KB Output is correct
5 Execution timed out 5071 ms 46416 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Correct 5 ms 7404 KB Output is correct
4 Correct 6 ms 7404 KB Output is correct
5 Correct 7 ms 7532 KB Output is correct
6 Correct 6 ms 7404 KB Output is correct
7 Correct 6 ms 7404 KB Output is correct
8 Correct 1867 ms 69084 KB Output is correct
9 Correct 1963 ms 69080 KB Output is correct
10 Correct 3465 ms 69356 KB Output is correct
11 Execution timed out 5051 ms 57820 KB Time limit exceeded
12 Halted 0 ms 0 KB -