Submission #75821671


Source Code Expand

#include <bits/stdc++.h>
#pragma warning(disable:4996)
#pragma comment(linker,"/STACK:336777216")
#pragma GCC optimize("03,unroll-loops")
#pragma GCC target("avx,avx2,fma")

using namespace std;
using ll = long long;
using vl = vector<ll>;
using pll = pair<ll,ll>;

ll POW(ll a,ll b,ll rem) {
    ll p=1;
    a %= rem;
    for (;b;b>>=1,a=(a*a)%rem) {
        if (b&1)p = (p*a)%rem;
    }
    return p;
}

tuple<ll,ll,ll> extended_gcd(ll a,ll b) {
    if (a==0) return {b,0,1};
    auto [g,x,y] = extended_gcd(b%a,a);
    return {g,y-(b/a)*x,x};
}
ll modinverse(ll a ,ll m) {
    return (get<1>(extended_gcd(a,m))%m+m)%m;
}

void pre() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

void pre2() {
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
}

void presolve() {

}

void solve() {
    ll N,M;
    cin>>N>>M;
    vl p(N+1),w(N+1), d(N+1);
    for (int i=1;i<=N;i++)cin>>w[i];
    for (int i=1;i<=N;i++) {
        cin>>p[i];
        d[p[i]]=1;
    }

    ll ans=0;
    for (int i=1;i<=N;i++) {
        if (d[i]==0)ans++;
    }
    cout<<ans+1;
}

int main() {
    pre();

    presolve();

    ll t=1;
    //cin>>t;
    while (t--) solve();
}

Submission Info

Submission Time
Task A - Mobilint Tensor Scheduling (REGULUS)
User kuming19
Language C++23 (GCC 15.2.0)
Score 100
Code Size 1260 Byte
Status AC
Exec Time 2 ms
Memory 3672 KiB

Compile Error

./Main.cpp:2: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    2 | #pragma warning(disable:4996)
./Main.cpp:3: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    3 | #pragma comment(linker,"/STACK:336777216")

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status AC
AC × 70
Set Name Test Cases
Sample
All 01, 02, 03, 04, 05, 06, 07, 08, 09, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70
Case Name Status Exec Time Memory
01 AC 1 ms 3388 KiB
02 AC 1 ms 3528 KiB
03 AC 1 ms 3464 KiB
04 AC 1 ms 3440 KiB
05 AC 1 ms 3440 KiB
06 AC 1 ms 3464 KiB
07 AC 1 ms 3540 KiB
08 AC 1 ms 3468 KiB
09 AC 1 ms 3532 KiB
10 AC 1 ms 3468 KiB
11 AC 1 ms 3396 KiB
12 AC 1 ms 3456 KiB
13 AC 1 ms 3480 KiB
14 AC 1 ms 3388 KiB
15 AC 1 ms 3336 KiB
16 AC 1 ms 3508 KiB
17 AC 1 ms 3452 KiB
18 AC 1 ms 3532 KiB
19 AC 1 ms 3452 KiB
20 AC 1 ms 3532 KiB
21 AC 1 ms 3444 KiB
22 AC 1 ms 3508 KiB
23 AC 1 ms 3468 KiB
24 AC 1 ms 3372 KiB
25 AC 1 ms 3448 KiB
26 AC 1 ms 3544 KiB
27 AC 1 ms 3448 KiB
28 AC 1 ms 3404 KiB
29 AC 1 ms 3396 KiB
30 AC 1 ms 3532 KiB
31 AC 1 ms 3428 KiB
32 AC 1 ms 3532 KiB
33 AC 1 ms 3480 KiB
34 AC 1 ms 3336 KiB
35 AC 1 ms 3448 KiB
36 AC 1 ms 3336 KiB
37 AC 1 ms 3544 KiB
38 AC 1 ms 3504 KiB
39 AC 1 ms 3288 KiB
40 AC 1 ms 3316 KiB
41 AC 1 ms 3608 KiB
42 AC 1 ms 3608 KiB
43 AC 1 ms 3576 KiB
44 AC 1 ms 3512 KiB
45 AC 1 ms 3672 KiB
46 AC 1 ms 3524 KiB
47 AC 1 ms 3660 KiB
48 AC 1 ms 3516 KiB
49 AC 1 ms 3464 KiB
50 AC 1 ms 3524 KiB
51 AC 1 ms 3516 KiB
52 AC 1 ms 3524 KiB
53 AC 1 ms 3596 KiB
54 AC 1 ms 3580 KiB
55 AC 1 ms 3672 KiB
56 AC 1 ms 3516 KiB
57 AC 1 ms 3660 KiB
58 AC 1 ms 3672 KiB
59 AC 1 ms 3572 KiB
60 AC 1 ms 3596 KiB
61 AC 1 ms 3516 KiB
62 AC 1 ms 3516 KiB
63 AC 1 ms 3464 KiB
64 AC 1 ms 3516 KiB
65 AC 1 ms 3576 KiB
66 AC 1 ms 3580 KiB
67 AC 2 ms 3576 KiB
68 AC 2 ms 3660 KiB
69 AC 2 ms 3576 KiB
70 AC 1 ms 3568 KiB