Submission #526637

#	Time	Username	Problem	Language	Result	Execution time	Memory
526637		XEMPLI5	Arcade (NOI20_arcade)	C++17	51 / 100	23 ms	1928 KiB

Arcade

#include <bits/stdc++.h>
using namespace std;
 
#define gc getchar_unlocked
#define fo(i, n) for (int i = 0; i < n; i++)
#define rfo(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = a; i >= b; i--)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define deb3(x, y, z) cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
 
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
 
int mpow(int base, int exp);
 
const int mod = 1'000'000'007;
const int N = 3e2 + 100, M = N;
 
int graph[N][N], match[N], seen[N];
int n, m;
 
bool bim(int cur)
{
    fo(i, m)
    {
        if (graph[cur][i] && !seen[i])
        {
            seen[i] = true;
            if (match[i] == -1 || bim(match[i]))
            {
                match[i] = cur;
                return true;
            }
        }
    }
    return false;
}
 
int bip()
{
    memset(match, -1, sizeof(match));
    int ans = 0;
    fo(i, m)
    {
        memset(seen, 0, sizeof(seen));
        ans += bim(i);
    }
    return ans;
}
 
void solve()
{
    cin >> n >> m;
    vpii times(m);
    fo(i, m) cin >> times[i].F;
    fo(i, m) cin >> times[i].S;
    sortall(times);
    times.resize(distance(times.begin(), unique(all(times))));
    m = times.size();
    fo(i, m)
    {
        REP(j, i + 1, m)
        {
            if (times[j].F - times[i].F >= abs(times[i].S - times[j].S))
            {
                graph[i][j] = 1;
            }
        }
    }
    int mxm = bip();
    cout << m - mxm << '\n';
    return;
}
 
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    srand(chrono::high_resolution_clock::now().time_since_epoch().count());
 
    int t = 1;
    int cs = 0;
    while (t - cs)
    {
        solve();
        cs++;
    }
 
    return 0;
}
 
int mpow(int base, int exp)
{
    base %= mod;
    int result = 1;
    while (exp > 0)
    {
        if (exp & 1)
            result = ((ll)result * base) % mod;
        base = ((ll)base * base) % mod;
        exp >>= 1;
    }
    return result;
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 0 / 14
• Subtask 6: 0 / 20
• Subtask 7: 0 / 15