Menu

#include <bits/stdc++.h>
#define ll long long
#define M 1000000007
#define N 2000

using namespace std;

ll p[N];
ll w[N];
ll ans = 0;
map<ll, ll> m;
set<pair<ll, pair<int, int>>> s;

int main () {
  cin.sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin>>n;
  for (int i = 0; i < n; i++) cin>>p[i]>>w[i];
  ans = n;
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      if (p[i] != p[j] && w[i] != w[j]) {
	if ((p[i] > p[j]) != (w[i] > w[j])) ans++, s.insert({max(p[i] + w[i], p[j] + w[j]), {i, j}});
      }
    }
  }
  ll pr = 0;
  for (auto x : m) {
    m[x.first] += m[pr];
    pr = x.first;
  }
  
  for (int i = 0; i < n; i++) {
    for (auto e : s) {
      int x = e.second.first;
      int y = e.second.second;
      if (x == i || y == i) continue;
      if ((p[i] < p[x]) == (p[i] < p[y]) || (w[i] < w[x]) == (w[i] < w[y])) continue;
      if (p[i] + w[i] >= e.first) {
	ans = (ans + 1) % M;
      } else {
	break;
      }
    }
  }
  
  cout<<ans<<endl;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: TIME LIMIT EXCEEDED

Test 18

Verdict: TIME LIMIT EXCEEDED

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: TIME LIMIT EXCEEDED