Ravintola

input/code.cpp: In function 'int main()':
input/code.cpp:52:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if(j+step < foo.size() && foo[j+step].e <= foo[i].s) {
                 ^
input/code.cpp:67:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int64_t i=0;i<events.size();i++) {
                    ^
input/code.cpp:78:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int64_t i=0;i<bar.size();i++) {
                    ^

#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;

struct argh {
  int64_t s,e,id;
};

bool operator<(const argh &a1, const argh &a2) {
  if(a1.e < a2.e) return true;
  if(a1.e == a2.e && a1.s < a2.s) return true;
  if(a1.e == a2.e && a1.s == a2.s && a1.id < a2.id) return true;
  return false;
}

struct ev {
  int64_t t, type, id;
};

bool operator<(const ev &a1, const ev &a2) {
  if(a1.t < a2.t) return true;
  if(a1.t == a2.t && a1.type < a2.type) return true;
  if(a1.t == a2.t && a1.type == a2.type && a1.id < a2.id) return true;
  return false;
}


int main(void) 
{
  int64_t n;
  cin >> n;
  vector<argh> foo(n);
  vector<ev> events;
  for(int64_t i=0;i<n;i++) {
    int64_t a,b;
    cin >> a >> b;
    foo[i]=argh{a,b,i};
    events.push_back(ev{a, 1, i});
    events.push_back(ev{b, 0, i});
  }
  sort(foo.begin(), foo.end());
  sort(events.begin(), events.end());
  int64_t m=0;
  for(int64_t i=0;i<n;i++) {
    //search from start to foo[i].b
    //i.e. find last thing whose end is <= start
    int64_t j=0;
    bool found=false;
    for(int64_t step=((int64_t)1<<(int64_t)30);step>=1;step/=2) {
      if(j+step < foo.size() && foo[j+step].e <= foo[i].s) {
        found=true;
        j+=step;
      }
    }
    j++;
    if(found) m=max(m, i-j+1);
    else {
      m=max(m, (int64_t)1);
    }
  }
  cout << m << endl;
  vector<int> tables(m,0);
  int64_t ti=0;
  vector<int64_t> bar(n);
  for(int64_t i=0;i<events.size();i++) {
    if(events[i].type) {
      while(tables[ti] != 0) {
        ti=(ti+1)%tables.size();
      }
      tables[ti]=1;
      bar[events[i].id]=ti;
    } else {
      tables[bar[events[i].id]]=0;
    }
  }
  for(int64_t i=0;i<bar.size();i++) {
    cout << bar[i]+1 << '\n';
  }
  return 0;
}

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER