oj.uz

Submission #752242

# Submission time Handle Problem Language Result Execution time Memory
752242 2023-06-02T15:00:48 Z salmon Meteors (POI11_met) C++14
0 / 100
 2489 ms 54640 KB 
//meteors
#include <bits/stdc++.h>
using namespace std;

long long int st[1200100];
vector<int> place[300100];
int N,M,h;
int k;
int g[300100];
vector<int> m[300100];
int s[300100];
int e[300100];
vector<vector<int>> days;
int ans[300100];

void build(int i, int s, int e){
    if(s == e){
        st[i] = 0;
        return;
    }

    build(i * 2,s,(s+e)/2);
    build(i*2+1,(s+e)/2+1, e);
}

void update(int i, int s, int e, int S, int E, int k){
    if(S <= s && e <= E){
        st[i] = st[i] + k;
        return;
    }

    int m = (s + e)/2;

    if(S <= m){
        update(i * 2, s, m,S,E,k);
    }
    if(m < E){
        update(i*2+1,m+1,e,S,E,k);
    }
}

long long int query(int i, int s, int e, int in){
    if(s == e){
        return st[i];
    }

    int m = (s + e)/2;

    if(in <= m){
        return st[i] + query(i*2, s, m, in);
    }
    else{
        return st[i] + query(i * 2+1,m + 1, e, in);
    }
}

int main(){

    scanf(" %d",&N);
    scanf(" %d",&M);

    for(int i = 1; i <= M; i++){
        scanf(" %d",&h);
        place[h].push_back(i);
    }

    for(int i = 1; i <= N; i++){
        scanf(" %d",&g[i]);
    }

    scanf(" %d",&k);

    for(int i = 1; i <= N; i++){
        s[i] = 1;
        e[i] = k + 1;
        m[(k + 2)/2].push_back(i);
    }

    for(int i = 1; i <= k ; i++){
        int s,e,a;

        scanf(" %d",&s);
        scanf(" %d",&e);
        scanf(" %d",&a);

        vector<int> v = {s,e,a};
        days.push_back(v);
    }

    bool flag = true;

    while(flag){
        flag = false;

        build(1,1,M);

        for(int i = 1; i <= k; i++){
            if(days[i-1][1] < days[i-1][0]){
                update(1,1,M,1,days[i-1][1],days[i-1][2]);
                update(1,1,M,days[i-1][0],M,days[i-1][2]);
            }
            else{
                update(1,1,M,days[i-1][0],days[i-1][1],days[i-1][2]);
            }

            for(int j : m[i]){
                flag = true;

                long long int some = 0;

                for(int k : place[j]){
                    some = some + query(1,1,M,k);
                }

                if(some >= g[j]){
                    e[j] = (s[j] + e[j])/2;
                }
                else{
                    s[j] = (s[j] + e[j])/2 + 1;
                }

                if(e[j] != s[j]){
                    m[(s[j] + e[j])/2].push_back(j);
                }
                else{
                    ans[j] = s[j];
                }
            }

            m[i].clear();
        }
    }

    for(int i = 1; i <= N; i++){
        if(ans[i] == k + 1){
            printf("NIE\n");
        }
        else{
            printf("%d\n",ans[i]);
        }
    }

    /*for(int j = 0; j <= k; j++){
        for(int i = 1; i <= M; i++){
            printf("%lld ",query(root[j],1,M,i));
        }
        printf("\n");
    }*/
}

Compilation message

met.cpp: In function 'int main()':
met.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     scanf(" %d",&N);
      |     ~~~~~^~~~~~~~~~
met.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |     scanf(" %d",&M);
      |     ~~~~~^~~~~~~~~~
met.cpp:63:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         scanf(" %d",&h);
      |         ~~~~~^~~~~~~~~~
met.cpp:68:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         scanf(" %d",&g[i]);
      |         ~~~~~^~~~~~~~~~~~~
met.cpp:71:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |     scanf(" %d",&k);
      |     ~~~~~^~~~~~~~~~
met.cpp:82:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |         scanf(" %d",&s);
      |         ~~~~~^~~~~~~~~~
met.cpp:83:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |         scanf(" %d",&e);
      |         ~~~~~^~~~~~~~~~
met.cpp:84:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         scanf(" %d",&a);
      |         ~~~~~^~~~~~~~~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 14420 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 14568 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 296 ms 19764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 305 ms 20828 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 183 ms 19920 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 311 ms 19576 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2440 ms 54640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2489 ms 52784 KB Output isn't correct
2 Halted 0 ms 0 KB -