oj.uz

Submission #220421

# Submission time Handle Problem Language Result Execution time Memory
220421 2020-04-07T22:33:32 Z Haunted_Cpp Kralj (COCI16_kralj) C++17
56 / 140
 661 ms 37640 KB 
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
#include <random>
#include <chrono>
#include <iomanip>
 
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
 
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

int main () {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vi ordem (n);
  F0R (i, n) {
    cin >> ordem[i];
    assert (ordem[i] == 1);
  }
  vi a (n);
  F0R (i, n) {
    cin >> a[i];
  }
  multiset<int> b;
  F0R (i, n) {
    int foo;
    cin >> foo;
    b.insert(foo);
  }
  int res = 0;
  F0R (i, n) {
    int cur = a[i];
    auto best = b.upper_bound(cur);
    if (best == b.end()) continue;
    res += (*best > cur);
    b.erase(best);
  } 
  cout << res << '\n';
  return 0;
}

Subtask #1
56.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 661 ms 30840 KB Output is correct
2 Correct 493 ms 29688 KB Output is correct
3 Correct 600 ms 37112 KB Output is correct
4 Correct 585 ms 37640 KB Output is correct
5 Runtime error 8 ms 4224 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 8 ms 4096 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 8 ms 4224 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 13 ms 3980 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 9 ms 4480 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 8 ms 4480 KB Execution killed with signal 11 (could be triggered by violating memory limits)