oj.uz

Submission #239814

# Submission time Handle Problem Language Result Execution time Memory
239814 2020-06-17T10:41:14 Z mhy908 Pilot (NOI19_pilot) C++14
89 / 100
 1000 ms 72204 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
#define lb(x, v) lower_bound(x.begin(), x.end(), v)
#define ub(x, v) upper_bound(x.begin(), x.end(), v)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2000000000000000000;
const LL mod1=1000000007;
const LL mod2=998244353;
const int inf=2000000000;
int n, q;
vector<int> vc[1000010];
LL ans[1000010], nans, tmp;
bool ch[1000010];
struct UNION_FIND{
    int par[1000010];
    LL sz[1000010];
    UNION_FIND(){for(int i=1; i<=1000000; i++)par[i]=i, sz[i]=1;}
    int findpar(int num){return num==par[num]?num:par[num]=findpar(par[num]);}
    void mergepar(int a, int b){
        a=findpar(a);
        b=findpar(b);
        if(a==b)return;
        nans-=sz[a]*(sz[a]+1)/2;
        nans-=sz[b]*(sz[b]+1)/2;
        sz[a]+=sz[b];
        par[b]=a;
        nans+=sz[a]*(sz[a]+1)/2;
    }
}uf;
int main(){
    scanf("%d %d", &n, &q);
    nans=(LL)n;
    tmp=(LL)n;
    for(int i=1; i<=n; i++){
        int a;
        scanf("%d", &a);
        vc[a].eb(i);
    }
    for(int i=1; i<=1000000; i++){
        for(auto j:vc[i]){
            ch[j]=true;
            if(ch[j+1])uf.mergepar(j, j+1);
            if(ch[j-1])uf.mergepar(j-1, j);
            tmp--;
        }
        ans[i]=nans-tmp;
    }
    for(int i=1; i<=q; i++){
        int a;
        scanf("%d", &a);
        printf("%lld\n", ans[a]);
    }
}

Compilation message

pilot.cpp: In function 'int main()':
pilot.cpp:42:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &q);
     ~~~~~^~~~~~~~~~~~~~~~~
pilot.cpp:47:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~
pilot.cpp:61:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a);
         ~~~~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 43392 KB Output is correct
2 Correct 30 ms 43264 KB Output is correct
3 Correct 29 ms 43392 KB Output is correct
4 Correct 29 ms 43392 KB Output is correct
5 Correct 30 ms 43384 KB Output is correct
6 Correct 30 ms 43392 KB Output is correct
7 Correct 29 ms 43392 KB Output is correct
8 Correct 30 ms 43392 KB Output is correct
9 Correct 29 ms 43392 KB Output is correct
10 Correct 30 ms 43392 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 43392 KB Output is correct
2 Correct 30 ms 43264 KB Output is correct
3 Correct 29 ms 43392 KB Output is correct
4 Correct 29 ms 43392 KB Output is correct
5 Correct 30 ms 43384 KB Output is correct
6 Correct 30 ms 43392 KB Output is correct
7 Correct 29 ms 43392 KB Output is correct
8 Correct 30 ms 43392 KB Output is correct
9 Correct 29 ms 43392 KB Output is correct
10 Correct 30 ms 43392 KB Output is correct
11 Correct 38 ms 43384 KB Output is correct
12 Correct 30 ms 43392 KB Output is correct
13 Correct 30 ms 43392 KB Output is correct
14 Correct 32 ms 43384 KB Output is correct
15 Correct 30 ms 43384 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 43392 KB Output is correct
2 Correct 30 ms 43264 KB Output is correct
3 Correct 29 ms 43392 KB Output is correct
4 Correct 29 ms 43392 KB Output is correct
5 Correct 30 ms 43384 KB Output is correct
6 Correct 30 ms 43392 KB Output is correct
7 Correct 29 ms 43392 KB Output is correct
8 Correct 30 ms 43392 KB Output is correct
9 Correct 29 ms 43392 KB Output is correct
10 Correct 30 ms 43392 KB Output is correct
11 Correct 38 ms 43384 KB Output is correct
12 Correct 30 ms 43392 KB Output is correct
13 Correct 30 ms 43392 KB Output is correct
14 Correct 32 ms 43384 KB Output is correct
15 Correct 30 ms 43384 KB Output is correct
16 Correct 29 ms 43392 KB Output is correct
17 Correct 29 ms 43392 KB Output is correct
18 Correct 30 ms 43392 KB Output is correct
19 Correct 29 ms 43392 KB Output is correct
20 Correct 30 ms 43384 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 43392 KB Output is correct
2 Correct 30 ms 43264 KB Output is correct
3 Correct 29 ms 43392 KB Output is correct
4 Correct 29 ms 43392 KB Output is correct
5 Correct 30 ms 43384 KB Output is correct
6 Correct 30 ms 43392 KB Output is correct
7 Correct 29 ms 43392 KB Output is correct
8 Correct 30 ms 43392 KB Output is correct
9 Correct 29 ms 43392 KB Output is correct
10 Correct 30 ms 43392 KB Output is correct
11 Correct 38 ms 43384 KB Output is correct
12 Correct 30 ms 43392 KB Output is correct
13 Correct 30 ms 43392 KB Output is correct
14 Correct 32 ms 43384 KB Output is correct
15 Correct 30 ms 43384 KB Output is correct
16 Correct 29 ms 43392 KB Output is correct
17 Correct 29 ms 43392 KB Output is correct
18 Correct 30 ms 43392 KB Output is correct
19 Correct 29 ms 43392 KB Output is correct
20 Correct 30 ms 43384 KB Output is correct
21 Correct 31 ms 43392 KB Output is correct
22 Correct 30 ms 43520 KB Output is correct
23 Correct 30 ms 43392 KB Output is correct
24 Correct 31 ms 43392 KB Output is correct
25 Correct 30 ms 43392 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 45944 KB Output is correct
2 Correct 83 ms 47096 KB Output is correct
3 Correct 59 ms 45944 KB Output is correct
4 Correct 72 ms 46712 KB Output is correct
5 Correct 60 ms 45816 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 48120 KB Output is correct
2 Correct 93 ms 48248 KB Output is correct
3 Correct 82 ms 48120 KB Output is correct
4 Correct 90 ms 48248 KB Output is correct
5 Correct 82 ms 48248 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 48248 KB Output is correct
2 Correct 89 ms 48248 KB Output is correct
3 Correct 90 ms 48120 KB Output is correct
4 Correct 92 ms 48376 KB Output is correct
5 Correct 93 ms 48376 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 43392 KB Output is correct
2 Correct 30 ms 43264 KB Output is correct
3 Correct 29 ms 43392 KB Output is correct
4 Correct 29 ms 43392 KB Output is correct
5 Correct 30 ms 43384 KB Output is correct
6 Correct 30 ms 43392 KB Output is correct
7 Correct 29 ms 43392 KB Output is correct
8 Correct 30 ms 43392 KB Output is correct
9 Correct 29 ms 43392 KB Output is correct
10 Correct 30 ms 43392 KB Output is correct
11 Correct 61 ms 45944 KB Output is correct
12 Correct 83 ms 47096 KB Output is correct
13 Correct 59 ms 45944 KB Output is correct
14 Correct 72 ms 46712 KB Output is correct
15 Correct 60 ms 45816 KB Output is correct
16 Correct 66 ms 45816 KB Output is correct
17 Correct 84 ms 47096 KB Output is correct
18 Correct 81 ms 47224 KB Output is correct
19 Correct 58 ms 45816 KB Output is correct
20 Correct 81 ms 46968 KB Output is correct
21 Correct 63 ms 45816 KB Output is correct
22 Correct 76 ms 46868 KB Output is correct
23 Correct 63 ms 45944 KB Output is correct
24 Correct 76 ms 46840 KB Output is correct
25 Correct 63 ms 45920 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 43392 KB Output is correct
2 Correct 30 ms 43264 KB Output is correct
3 Correct 29 ms 43392 KB Output is correct
4 Correct 29 ms 43392 KB Output is correct
5 Correct 30 ms 43384 KB Output is correct
6 Correct 30 ms 43392 KB Output is correct
7 Correct 29 ms 43392 KB Output is correct
8 Correct 30 ms 43392 KB Output is correct
9 Correct 29 ms 43392 KB Output is correct
10 Correct 30 ms 43392 KB Output is correct
11 Correct 38 ms 43384 KB Output is correct
12 Correct 30 ms 43392 KB Output is correct
13 Correct 30 ms 43392 KB Output is correct
14 Correct 32 ms 43384 KB Output is correct
15 Correct 30 ms 43384 KB Output is correct
16 Correct 29 ms 43392 KB Output is correct
17 Correct 29 ms 43392 KB Output is correct
18 Correct 30 ms 43392 KB Output is correct
19 Correct 29 ms 43392 KB Output is correct
20 Correct 30 ms 43384 KB Output is correct
21 Correct 31 ms 43392 KB Output is correct
22 Correct 30 ms 43520 KB Output is correct
23 Correct 30 ms 43392 KB Output is correct
24 Correct 31 ms 43392 KB Output is correct
25 Correct 30 ms 43392 KB Output is correct
26 Correct 61 ms 45944 KB Output is correct
27 Correct 83 ms 47096 KB Output is correct
28 Correct 59 ms 45944 KB Output is correct
29 Correct 72 ms 46712 KB Output is correct
30 Correct 60 ms 45816 KB Output is correct
31 Correct 81 ms 48120 KB Output is correct
32 Correct 93 ms 48248 KB Output is correct
33 Correct 82 ms 48120 KB Output is correct
34 Correct 90 ms 48248 KB Output is correct
35 Correct 82 ms 48248 KB Output is correct
36 Correct 89 ms 48248 KB Output is correct
37 Correct 89 ms 48248 KB Output is correct
38 Correct 90 ms 48120 KB Output is correct
39 Correct 92 ms 48376 KB Output is correct
40 Correct 93 ms 48376 KB Output is correct
41 Correct 66 ms 45816 KB Output is correct
42 Correct 84 ms 47096 KB Output is correct
43 Correct 81 ms 47224 KB Output is correct
44 Correct 58 ms 45816 KB Output is correct
45 Correct 81 ms 46968 KB Output is correct
46 Correct 63 ms 45816 KB Output is correct
47 Correct 76 ms 46868 KB Output is correct
48 Correct 63 ms 45944 KB Output is correct
49 Correct 76 ms 46840 KB Output is correct
50 Correct 63 ms 45920 KB Output is correct
51 Correct 107 ms 46968 KB Output is correct
52 Correct 117 ms 47608 KB Output is correct
53 Correct 101 ms 47096 KB Output is correct
54 Correct 109 ms 47608 KB Output is correct
55 Correct 122 ms 46968 KB Output is correct

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 43392 KB Output is correct
2 Correct 30 ms 43264 KB Output is correct
3 Correct 29 ms 43392 KB Output is correct
4 Correct 29 ms 43392 KB Output is correct
5 Correct 30 ms 43384 KB Output is correct
6 Correct 30 ms 43392 KB Output is correct
7 Correct 29 ms 43392 KB Output is correct
8 Correct 30 ms 43392 KB Output is correct
9 Correct 29 ms 43392 KB Output is correct
10 Correct 30 ms 43392 KB Output is correct
11 Correct 38 ms 43384 KB Output is correct
12 Correct 30 ms 43392 KB Output is correct
13 Correct 30 ms 43392 KB Output is correct
14 Correct 32 ms 43384 KB Output is correct
15 Correct 30 ms 43384 KB Output is correct
16 Correct 29 ms 43392 KB Output is correct
17 Correct 29 ms 43392 KB Output is correct
18 Correct 30 ms 43392 KB Output is correct
19 Correct 29 ms 43392 KB Output is correct
20 Correct 30 ms 43384 KB Output is correct
21 Correct 31 ms 43392 KB Output is correct
22 Correct 30 ms 43520 KB Output is correct
23 Correct 30 ms 43392 KB Output is correct
24 Correct 31 ms 43392 KB Output is correct
25 Correct 30 ms 43392 KB Output is correct
26 Correct 61 ms 45944 KB Output is correct
27 Correct 83 ms 47096 KB Output is correct
28 Correct 59 ms 45944 KB Output is correct
29 Correct 72 ms 46712 KB Output is correct
30 Correct 60 ms 45816 KB Output is correct
31 Correct 81 ms 48120 KB Output is correct
32 Correct 93 ms 48248 KB Output is correct
33 Correct 82 ms 48120 KB Output is correct
34 Correct 90 ms 48248 KB Output is correct
35 Correct 82 ms 48248 KB Output is correct
36 Correct 89 ms 48248 KB Output is correct
37 Correct 89 ms 48248 KB Output is correct
38 Correct 90 ms 48120 KB Output is correct
39 Correct 92 ms 48376 KB Output is correct
40 Correct 93 ms 48376 KB Output is correct
41 Correct 66 ms 45816 KB Output is correct
42 Correct 84 ms 47096 KB Output is correct
43 Correct 81 ms 47224 KB Output is correct
44 Correct 58 ms 45816 KB Output is correct
45 Correct 81 ms 46968 KB Output is correct
46 Correct 63 ms 45816 KB Output is correct
47 Correct 76 ms 46868 KB Output is correct
48 Correct 63 ms 45944 KB Output is correct
49 Correct 76 ms 46840 KB Output is correct
50 Correct 63 ms 45920 KB Output is correct
51 Correct 107 ms 46968 KB Output is correct
52 Correct 117 ms 47608 KB Output is correct
53 Correct 101 ms 47096 KB Output is correct
54 Correct 109 ms 47608 KB Output is correct
55 Correct 122 ms 46968 KB Output is correct
56 Execution timed out 1101 ms 72204 KB Time limit exceeded
57 Halted 0 ms 0 KB -