제출 #1177697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177697		tamzid	Pilot (NOI19_pilot)	C++20	3 / 100	15 ms	1096 KiB

pilot

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v)  for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout << it << " "; cout << endl;
using namespace std;
//using namespace __gnu_pbds;
//template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve()
{
    int n,q;
    cin>>n>>q;
    vii v(n);
    cinv(v);
    vii y(n);
    cinv(y);
    int ans = 0;
    if(y[0]>=v[0])
    {
        ++ans;
    }
    if(y[0]>=v[1])
    {
        ++ans;
    }
    if(ans==2)
    {
        ++ans;
    }
    cout<<ans<<'\n';
}

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

    //int t;cin>>t;while(t--)
        solve();

    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 5
• Subtask 6: 0 / 9
• Subtask 7: 0 / 14
• Subtask 8: 0 / 10
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11