Submission #1072123

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072123		FIFI_cpp	Pilot (NOI19_pilot)	C++17	28 / 100	68 ms	11964 KiB

pilot

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <iterator>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cctype>
#include <string>
#include <cassert>
#include <set>
#include <bitset>
#include <unordered_set>
using ll = int64_t;
#define pb push_back
#define all(a) a.begin(),a.end()
#define ppb pair<pair<int,int>,bool>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int int64_t
// xcode cant include bits/stdc++.h
using namespace std;
//ifstream fin ("sleepy.in");
//ofstream fout ("sleepy.out");
/*   /\_/\
*   (= ._.)
*   / >  \>
*/
// encouraging cat
const int INF = 1844674407370955161;
const int mod = 1000000007;
int parent[1000001];
int sz[1000001];
int curr = 0;
int find(int x)
{
    if (x != parent[x])
        return parent[x] = find(parent[x]);
    return x;
}
void onion(int a,int b)
{
    a = find(a);
    b = find(b);
    if (a == b)
        return;
    if (sz[a] < sz[b])
        swap(a,b);
    curr += sz[a] * sz[b];
    sz[a] += sz[b];
    parent[b] = a;
}
int32_t main() {
    int n,q;
    cin >> n >> q;
    vector<pair<int,int>> events;
    for (int i = 1;i <= n;i++)
    {
        int h;
        cin >> h;
        events.pb({h,-i});
    }
    for (int i = 1;i <= q;i++)
    {
        int h;
        cin >> h;
        events.pb({h,i});
    }
    sort(all(events));
    vector<int> res(q,0);
    for (pair<int,int> i : events)
    {
        if (i.second > 0)
        {
            res[i.second] = curr;
        }
        else
        {
            curr++;
            int x = -i.second;
            parent[x] = x;
            sz[x] = 1;
            if (parent[x + 1])
            {
                onion(x,x + 1);
            }
            if (parent[x - 1])
            {
                onion(x,x - 1);
            }
        }
    }
    for (int i = 1;i <= q;i++)
    {
        cout << res[i] << '\n';
    }
    return 0;
}

Compilation message (stderr)

pilot.cpp:32:9: warning: "/*" within comment [-Wcomment]
   32 | /*   /\_/\
      |

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