Submission #625935

---

Source Code Expand

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

using namespace std;


class Room
{
public:
  int id;
  int score;
  Room(){id = 0; score = 0;};
};

bool operator<(const Room& r1, const Room& r2) {
  return r1.score != r2.score
         ? r1.score < r2.score
         : r1.id < r2.id;
}


int main()
{
  int n;
  cin >> n;
  vector<Room> rs(n);
  for(int i = 0; i < n; ++i)
  {
    int score;
    cin >> score;
    rs[i].id = i;
    rs[i].score = score;
  }

  sort(rs.begin(), rs.end());

  int prev_id = -1,
      cur_score = rs[0].score,
      loop = 0;
  for(int i = 0; i < n;)
  {
    if(rs[i].score == cur_score)
    {
      if(rs[i].id > prev_id)
      {
        if(i == 0 || rs[i-1].score < cur_score)
        {
          while(i < n && rs[i].score == cur_score) ++i;
          if(i == n) ++loop;
          else
          { 
            prev_id = rs[i-1].id;
            cur_score = rs[i].score;
          }
        }
        else
        {
          prev_id = rs[i].id;
          while(i < n && rs[i].score == cur_score) ++i;
          if(i != n) cur_score = rs[i].score;
          ++loop;
        }
      }
      else
      {
        if(i == n-1) loop += rs[i].id == 0 ? 1 : 2;
        ++i;
      }
    }
    else
    {
      prev_id = rs[i-1].id;
      cur_score = rs[i].score;
      ++loop;
    }
  }

  cout << loop << endl;

  return 0;
}

Submission Info

Judge Result