Ravintola

input/code.cpp: In function 'int64_t push(std::vector<std::pair<long int, long int> >&, int64_t)':
input/code.cpp:29:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
input/code.cpp: In function 'int64_t mark(std::vector<std::pair<long int, long int> >&, int64_t, int64_t)':
input/code.cpp:124:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
input/code.cpp: In function 'int main()':
input/code.cpp:151:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(M <= 2*coords.size()) {
           ^

#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
 
using namespace std;
 
typedef pair<int64_t,int64_t> P;
struct T {
  int64_t a, b, g;
};
 
bool operator<(const T& t1, const T& t2) {
  if(t1.b < t2.b) return true;
  if(t1.b == t2.b && t1.a < t2.a) return true;
  if(t1.b == t2.b && t1.a == t2.a && t1.g < t2.g) return true;
  return false;
}
 
int64_t M=1;
 
int64_t push(vector<pair<int64_t,int64_t>> &spuu, int64_t r) {
  spuu[2*r].first+=spuu[r].first;
  spuu[2*r].second+=spuu[r].first;
  spuu[2*r+1].first+=spuu[r].first;
  spuu[2*r+1].second+=spuu[r].first;
  spuu[r].first=0;
}
 
int64_t left(int64_t a) {
  while(a < M) {
    a*=2;
  }
  return a;
}
 
int64_t right(int64_t b) {
  while(b < M) {
    b=2*b+1;
  }
  return b;
}
int64_t leftmax(int64_t a) {
  return right(2*a);
}
int64_t rightmin(int64_t b) {
  return left(2*b+1);
}
 
int64_t getmax(vector<pair<int64_t,int64_t>> &spuu, int64_t a, int64_t b) {
  a+=M;
  b+=M;
  int64_t r1=1;
  while(left(r1) != a) {
    push(spuu, r1);
    if(leftmax(r1) >= a) r1*=2;
    else r1=2*r1+1;
  }
  int64_t r2=1;
  while(right(r2) != b) {
    push(spuu, r2);
    if(rightmin(r2) <= b) r2=2*r2+1;
    else r2=2*r2;
  }
  while(r1 != r2) {
    if(r1 > r2) {
      r1=(r1+1)/2;
    } else {
      r2=(r2-1)/2;
    }
  }
  return spuu[r1].second;
}
 
int64_t mark(vector<pair<int64_t,int64_t>> &spuu, int64_t a, int64_t b) {
  a+=M;
  b+=M;
  int64_t r1=1;
  while(left(r1) != a) {
    push(spuu, r1);
    if(leftmax(r1) >= a) r1*=2;
    else r1=2*r1+1;
  }
  int64_t r2=1;
  while(right(r2) != b) {
    push(spuu, r2);
    if(rightmin(r2) <= b) r2=2*r2+1;
    else r2=2*r2;
  }
 
 
  while(a <= b) {
    /*cout << "a: " << a << endl;
    cout << "b: " << b << endl;*/
    if(a%2 == 1) {
      spuu[a].first++;
      if(2*a < 2*M) {
        spuu[a].second=max(spuu[2*a].second+1, spuu[2*a+1].second+1);
      } else {
        spuu[a].second++;
      }
    }
    if(b%2 == 0) {
      spuu[b].first++;
      if(2*b < 2*M) {
        spuu[b].second=max(spuu[2*b].second+1, spuu[2*b+1].second+1);
      } else {
        spuu[b].second++;
      }
    }
    a=(a+1)/2;
    b=(b-1)/2;
  }
  while(a >= 1) {
    spuu[a].second=max(spuu[2*a].second, spuu[2*a+1].second);
    a/=2;
  }
  while(b >= 1) {
    spuu[b].second=max(spuu[2*b].second, spuu[2*b+1].second);
    b/=2;
  }
 
}
 
int main(void) 
{
  int64_t n;
  cin >> n;
 
  vector<T> times(n);
  set<int64_t> foo;
 
  for(int64_t i=0;i<n;i++) {
    cin >> times[i].a >> times[i].b;
    times[i].g=i;
    foo.insert(times[i].a);
    foo.insert(times[i].b);
  }
  sort(times.begin(),times.end());
 
  map<int64_t,int64_t> coords;
  map<int64_t,int64_t> invcoords;
  int64_t bar=0;
  for(auto s: foo) {
    invcoords[bar]=s;
    coords[s]=bar++;
  }
 
 
  while(M <= 2*coords.size()) {
    M*=2;
  }
  M/=2;
  vector<pair<int64_t,int64_t>> spuu(2*M);
 
 
  map<int64_t,int64_t> moves;
  int64_t maxm=0;
  for(int64_t i=0;i<n;i++) {
   // cout << "Marking: " << coords[times[i].a] << "(" << times[i].a << ") to " << coords[times[i].b]-1 << "(" << times[i].b << ")"<< endl;
    mark(spuu, coords[times[i].a], coords[times[i].b]-1);
    /*for(int64_t j=0;j<spuu.size();j++) {
      cout << j << ": " << spuu[j].first << "," << spuu[j].second << endl;
    }*/
    int64_t mym=getmax(spuu, coords[times[i].a], coords[times[i].b]-1);
    moves[times[i].g]=mym;
    maxm=max(mym,maxm);
  }
  cout << maxm << '\n';
  for(int64_t i=0;i<n;i++) {
    cout << moves[i] << '\n';
  }
  return 0;
}
 

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER