Submission #24362751


Source Code Expand

#include <bits/stdc++.h>
#include <cstdio>
 
using namespace std;
 
#define pb push_back
#define mp make_pair
#define gc getchar_unlocked
#define F first
#define S second
#define endl '\n'
 
#define PI 3.14159265358979323846
#define N 212345
#define MOD 1000000007

void printVector(vector<int> arr) {
  for (int a=0;a<arr.size();a++) {
    if (a>0) {
      cout << " ";
    }
    cout << arr[a];
  }
  cout<<endl;
}

void solve() {
  int n;
  cin>>n;

  vector <int> arr1, arr2, arr3;
  int x;
  for (int a=0;a<n;a++) {
    cin>>x;
    arr1.pb(x);
  }
  for (int a=0;a<n;a++) {
    cin>>x;
    arr2.pb(x);
  }
  for (int a=0;a<n;a++) {
    cin>>x;
    arr3.pb(x);
  }
  sort(arr1.begin(), arr1.end());
  sort(arr2.begin(), arr2.end());
  sort(arr3.begin(), arr3.end());

  int ptr1 = 0, ptr2 = 0, ptr3 = 0;
  int ans = 0;
  while (ptr1 < n && ptr2 < n && ptr3 < n) {
    if (arr1[ptr1] >= arr2[ptr2]) {
      ptr2++;
    } else if (arr1[ptr1] >= arr3[ptr3]) {
      ptr3++;
    } else if (arr2[ptr2] >= arr3[ptr3]) {
      ptr3++;
    } else {
      ans++;
      ptr1++, ptr2++, ptr3++;
    }
  }
  cout<<ans<<endl;
}

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

  int tt = 1;
  // cin >> tt;
  while(tt--) {
    solve();
  }
  //cout<<(clock()-st)/CLOCKS_PER_SEC<<endl;
  return 0;
}

Submission Info

Submission Time
Task B - Increasing Triples
User pickleRick
Language C++ (GCC 9.2.1)
Score 400
Code Size 1377 Byte
Status AC
Exec Time 64 ms
Memory 4680 KiB

Compile Error

./Main.cpp: In function ‘void printVector(std::vector<int>)’:
./Main.cpp:18:17: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   18 |   for (int a=0;a<arr.size();a++) {
      |                ~^~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 36
Set Name Test Cases
Sample 01_sample_01.txt, 01_sample_02.txt, 01_sample_03.txt
All 01_sample_01.txt, 01_sample_02.txt, 01_sample_03.txt, 02_rand_01.txt, 02_rand_02.txt, 02_rand_03.txt, 02_rand_04.txt, 02_rand_05.txt, 02_rand_06.txt, 02_rand_07.txt, 02_rand_08.txt, 02_rand_09.txt, 02_rand_10.txt, 03_rand_dense_01.txt, 03_rand_dense_02.txt, 03_rand_dense_03.txt, 03_rand_dense_04.txt, 03_rand_dense_05.txt, 03_rand_dense_06.txt, 03_rand_dense_07.txt, 03_rand_dense_08.txt, 03_rand_dense_09.txt, 03_rand_dense_10.txt, 04_small_ans_01.txt, 04_small_ans_02.txt, 04_small_ans_03.txt, 04_small_ans_04.txt, 04_small_ans_05.txt, 04_small_ans_06.txt, 04_small_ans_07.txt, 04_small_ans_08.txt, 04_small_ans_09.txt, 04_small_ans_10.txt, 05_handmade_01.txt, 05_handmade_02.txt, 05_handmade_03.txt
Case Name Status Exec Time Memory
01_sample_01.txt AC 11 ms 3584 KiB
01_sample_02.txt AC 2 ms 3508 KiB
01_sample_03.txt AC 2 ms 3516 KiB
02_rand_01.txt AC 64 ms 4576 KiB
02_rand_02.txt AC 57 ms 4488 KiB
02_rand_03.txt AC 56 ms 4576 KiB
02_rand_04.txt AC 55 ms 4520 KiB
02_rand_05.txt AC 55 ms 4644 KiB
02_rand_06.txt AC 55 ms 4500 KiB
02_rand_07.txt AC 55 ms 4608 KiB
02_rand_08.txt AC 55 ms 4572 KiB
02_rand_09.txt AC 57 ms 4572 KiB
02_rand_10.txt AC 59 ms 4616 KiB
03_rand_dense_01.txt AC 40 ms 4680 KiB
03_rand_dense_02.txt AC 38 ms 4520 KiB
03_rand_dense_03.txt AC 37 ms 4568 KiB
03_rand_dense_04.txt AC 34 ms 4500 KiB
03_rand_dense_05.txt AC 40 ms 4680 KiB
03_rand_dense_06.txt AC 36 ms 4576 KiB
03_rand_dense_07.txt AC 41 ms 4676 KiB
03_rand_dense_08.txt AC 37 ms 4548 KiB
03_rand_dense_09.txt AC 40 ms 4640 KiB
03_rand_dense_10.txt AC 40 ms 4616 KiB
04_small_ans_01.txt AC 48 ms 4548 KiB
04_small_ans_02.txt AC 54 ms 4472 KiB
04_small_ans_03.txt AC 54 ms 4604 KiB
04_small_ans_04.txt AC 19 ms 3708 KiB
04_small_ans_05.txt AC 43 ms 4576 KiB
04_small_ans_06.txt AC 4 ms 3656 KiB
04_small_ans_07.txt AC 27 ms 3992 KiB
04_small_ans_08.txt AC 30 ms 4016 KiB
04_small_ans_09.txt AC 5 ms 3568 KiB
04_small_ans_10.txt AC 33 ms 4056 KiB
05_handmade_01.txt AC 55 ms 4476 KiB
05_handmade_02.txt AC 56 ms 4596 KiB
05_handmade_03.txt AC 40 ms 4600 KiB