Submission #19867365

---

Source Code Expand

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = 3.14159265359;

int d[100001];
int v[100001][3];

int main()
{
  int n;
  cin >> n;

  vector<pair<int,int>> p(n);
  for (int i = 0; i < n; i++){
    int r, h;
    cin >> r >> h;
    p[i] = make_pair(r, h);
    d[r]++;
    v[r][h-1]++;
  }

  for (int i = 1; i <= 100000; i++){
    d[i] += d[i-1];
  }

  for (int i = 0; i < n; i++){
    int r = p[i].first;
    int h = p[i].second;

    int nwin = d[r-1]; // with lesser rate
    if        (h == 1){
      nwin += v[r][2-1];
    } else if (h == 2){
      nwin += v[r][3-1];
    } else  /* h == 3 */ {
      nwin += v[r][1-1];
    }
    int ndraw = v[r][h-1] - 1;
    int nlose = (n-1) - nwin - ndraw;
    cout << nwin << " " << nlose << " " << ndraw << endl;;
  }
  
  return 0;
}

Submission Info

Judge Result