oj.uz

Submission #257930

# Submission time Handle Problem Language Result Execution time Memory
257930 2020-08-05T05:10:02 Z 문홍윤(#5065) Employment (JOI16_employment) C++17
40 / 100
 3185 ms 8400 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define svec(x) sort(x.begin(), x.end())
using namespace std;
typedef pair<int, int> pii;
const int BUC=1000;
const int MAXN=200000;
const int INF=1000000001;

int n, q, b;
int arr[MAXN+100000];
vector<pair<pii, pii> > vc[MAXN/BUC+10];
vector<pii> sor[MAXN/BUC+10];
int ch[MAXN+100000];

inline void get_vc(int bnum){
    vc[bnum].clear();
    vc[bnum].eb(mp(0, 0), mp(0, 0));
    for(int i=max(bnum*BUC-1, 0); i<=(bnum+1)*BUC; i++)ch[i]=0;
    int num=0;
    for(int i=0; i<sor[bnum].size(); i++){
        int nw=sor[bnum][i].S;
        ch[nw]=1;
        num++;
        if(nw>0&&ch[nw-1])num--;
        if(ch[nw+1])num--;
        if(i==sor[bnum].size()-1||sor[bnum][i+1].F!=sor[bnum][i].F){
            vc[bnum].eb(mp(sor[bnum][i].F, num), mp(ch[bnum*BUC], ch[(bnum+1)*BUC-1]));
        }
    }
}

inline pair<int, pii> query2(int bnum, int num){
    int tmp=lower_bound(vc[bnum].begin(), vc[bnum].end(), mp(mp(num, INF), mp(1, 1)))-vc[bnum].begin()-1;
    return mp(vc[bnum][tmp].F.S, vc[bnum][tmp].S);
}

inline int query(int num){
    int on=0, ans=0;
    for(int i=0; i<=b; i++){
        pair<int, pii> tmp=query2(i, num);
        ans+=tmp.F;
        if(on&&tmp.S.F)ans--;
        on=tmp.S.S;
    }
    return ans;
}

inline void update(int bnum, int a, int b){
    bool flg=false;
    if(arr[a]<=b){
        for(int i=0; i<sor[bnum].size(); i++){
            if(sor[bnum][i]==mp(arr[a], a))flg=true;
            if(i==sor[bnum].size()-1||sor[bnum][i+1].F>=b){
                sor[bnum][i]=mp(b, a);
                break;
            }
            if(flg)swap(sor[bnum][i], sor[bnum][i+1]);
        }
    }
    else{
        for(int i=sor[bnum].size()-1; i>=0; i--){
            if(sor[bnum][i]==mp(arr[a], a))flg=true;
            if(i==0||sor[bnum][i-1].F<=b){
                sor[bnum][i]=mp(b, a);
                break;
            }
            if(flg)swap(sor[bnum][i], sor[bnum][i-1]);
        }
    }
    arr[a]=b;
    get_vc(bnum);
}

int main(){
    scanf("%d %d", &n, &q);
    for(int i=0; i<n; i++){
        scanf("%d", &arr[i]);
        arr[i]=INF-arr[i];
    }
    b=(n-1)/BUC;
    for(int i=0; i<n; i++)sor[i/BUC].eb(arr[i], i);
    for(int i=0; i<=b; i++)svec(sor[i]);
    for(int i=0; i<=b; i++)get_vc(i);
    for(int i=1; i<=q; i++){
        int qnum;
        scanf("%d", &qnum);
        if(qnum==1){
            int a;
            scanf("%d", &a);
            printf("%d\n", query(INF-a));
        }
        else{
            int a, b;
            scanf("%d %d", &a, &b);
            a--;
            update(a/BUC, a, INF-b);
        }
    }
}

Compilation message

employment.cpp: In function 'void get_vc(int)':
employment.cpp:24:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<sor[bnum].size(); i++){
                  ~^~~~~~~~~~~~~~~~~
employment.cpp:30:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i==sor[bnum].size()-1||sor[bnum][i+1].F!=sor[bnum][i].F){
            ~^~~~~~~~~~~~~~~~~~~~
employment.cpp: In function 'void update(int, int, int)':
employment.cpp:55:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0; i<sor[bnum].size(); i++){
                      ~^~~~~~~~~~~~~~~~~
employment.cpp:57:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(i==sor[bnum].size()-1||sor[bnum][i+1].F>=b){
                ~^~~~~~~~~~~~~~~~~~~~
employment.cpp: In function 'int main()':
employment.cpp:79:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &q);
     ~~~~~^~~~~~~~~~~~~~~~~
employment.cpp:81:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &arr[i]);
         ~~~~~^~~~~~~~~~~~~~~
employment.cpp:90:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &qnum);
         ~~~~~^~~~~~~~~~~~~
employment.cpp:93:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &a);
             ~~~~~^~~~~~~~~~
employment.cpp:98:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d", &a, &b);
             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 11 ms 384 KB Output is correct
9 Correct 11 ms 384 KB Output is correct
10 Correct 15 ms 384 KB Output is correct
11 Correct 16 ms 384 KB Output is correct
12 Correct 15 ms 384 KB Output is correct
13 Correct 16 ms 384 KB Output is correct
14 Correct 16 ms 384 KB Output is correct
15 Correct 17 ms 384 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 32 ms 768 KB Output is correct
5 Correct 99 ms 1660 KB Output is correct
6 Correct 214 ms 1912 KB Output is correct
7 Correct 487 ms 3192 KB Output is correct
8 Correct 740 ms 3832 KB Output is correct
9 Correct 1776 ms 5228 KB Output is correct
10 Correct 1559 ms 7008 KB Output is correct
11 Correct 2506 ms 6944 KB Output is correct
12 Correct 3035 ms 7972 KB Output is correct
13 Correct 3114 ms 7928 KB Output is correct
14 Correct 3017 ms 7976 KB Output is correct
15 Correct 3015 ms 7864 KB Output is correct
16 Correct 3147 ms 8148 KB Output is correct
17 Correct 3166 ms 8400 KB Output is correct
18 Correct 3132 ms 8352 KB Output is correct
19 Correct 3185 ms 8172 KB Output is correct
20 Correct 3087 ms 7960 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 11 ms 384 KB Output is correct
9 Correct 11 ms 384 KB Output is correct
10 Correct 15 ms 384 KB Output is correct
11 Correct 16 ms 384 KB Output is correct
12 Correct 15 ms 384 KB Output is correct
13 Correct 16 ms 384 KB Output is correct
14 Correct 16 ms 384 KB Output is correct
15 Correct 17 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 32 ms 768 KB Output is correct
20 Correct 99 ms 1660 KB Output is correct
21 Correct 214 ms 1912 KB Output is correct
22 Correct 487 ms 3192 KB Output is correct
23 Correct 740 ms 3832 KB Output is correct
24 Correct 1776 ms 5228 KB Output is correct
25 Correct 1559 ms 7008 KB Output is correct
26 Correct 2506 ms 6944 KB Output is correct
27 Correct 3035 ms 7972 KB Output is correct
28 Correct 3114 ms 7928 KB Output is correct
29 Correct 3017 ms 7976 KB Output is correct
30 Correct 3015 ms 7864 KB Output is correct
31 Correct 3147 ms 8148 KB Output is correct
32 Correct 3166 ms 8400 KB Output is correct
33 Correct 3132 ms 8352 KB Output is correct
34 Correct 3185 ms 8172 KB Output is correct
35 Correct 3087 ms 7960 KB Output is correct
36 Incorrect 9 ms 384 KB Output isn't correct
37 Halted 0 ms 0 KB -