Submission #3768779


Source Code Expand

#include <bits/stdc++.h> 

#define INF INT_MAX/2
#define MOD 1000000007

using namespace std;

using ll = long long;
using ull = unsigned long long;

int main(){
   ios::sync_with_stdio(false);
   cin.tie(0);

   int N;
   cin>>N;
   vector<pair<int,int> > red(N),blue(N);
   for(int i=0;i<N;i++)cin>>red[i].first>>red[i].second;
   for(int i=0;i<N;i++)cin>>blue[i].first>>blue[i].second;

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

   ll ans = 0;
   for(int i=0;i<N;i++){
      int MAX = -INF;
      int point = -1;
      for(int j=0;j<N;j++){
         if(blue[i].first > red[j].first && blue[i].second > red[j].second){
            if(MAX < red[j].second){
               MAX = red[j].second;
               point = j;
            }
         }
      }
      if(point!=-1){
         ans++;
         red[point].first = INF;
      }
   }
   cout<<ans<<endl;
   return 0; 
}

Submission Info

Submission Time
Task C - 2D Plane 2N Points
User reg7777
Language C++14 (GCC 5.4.1)
Score 400
Code Size 907 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 5
AC × 17
Set Name Test Cases
Sample example_0, example_1, example_2, example_3, example_4
All example_0, example_1, example_2, example_3, example_4, line_0, line_1, line_2, line_3, maxrand_0, maxrand_1, maxrand_2, maxrand_3, maxrand_4, rand_0, rand_1, rand_2
Case Name Status Exec Time Memory
example_0 AC 1 ms 256 KB
example_1 AC 1 ms 256 KB
example_2 AC 1 ms 256 KB
example_3 AC 1 ms 256 KB
example_4 AC 1 ms 256 KB
line_0 AC 1 ms 256 KB
line_1 AC 1 ms 256 KB
line_2 AC 1 ms 256 KB
line_3 AC 1 ms 256 KB
maxrand_0 AC 1 ms 256 KB
maxrand_1 AC 1 ms 256 KB
maxrand_2 AC 1 ms 256 KB
maxrand_3 AC 1 ms 256 KB
maxrand_4 AC 1 ms 256 KB
rand_0 AC 1 ms 256 KB
rand_1 AC 1 ms 256 KB
rand_2 AC 1 ms 256 KB