Submission #212210

# Submission time Handle Problem Language Result Execution time Memory
212210 2020-03-22T13:43:24 Z Ruxandra985 Traffickers (RMI18_traffickers) C++14
35 / 100
3500 ms 524292 KB
#include <bits/stdc++.h>
#define DIMN 100010
using namespace std;
int tt[DIMN] , lvl[DIMN];
int up[DIMN] , l[DIMN] , d[DIMN] , poz[DIMN] , idx_aint[DIMN];

struct idk{

    idk *st , *dr;
    int sum;
    int val[220];
    idk(){
        st = dr = 0;
        sum = 0;
        memset (val , 0 , sizeof(val));
    }

};

vector < map <int,int> > aint[DIMN];
vector <int> v[DIMN] , w[DIMN];
int elem , lnt;
inline int code (int len , int rest){
    return (len + 2) * (len + 1) / 2 + rest + 1;
}
void dfs_lant(int nod , int fth){
    int i,vecin,ok=0,maxi,fiu;
    tt[nod] = fth;
    d[nod] = 1;
    maxi=0;
    fiu=0;
    for (i=0;i<v[nod].size();i++){
        vecin=v[nod][i];
        if (vecin!=tt[nod]){
            ok=1;
            lvl[vecin] = 1 + lvl[nod];
            dfs_lant(vecin , nod);
            d[nod] += d[vecin];
            if (d[vecin]>maxi){
                maxi=d[vecin];
                fiu=vecin;
            }
        }
    }
    if (!ok){ /// frunza
        lnt++;
        l[nod]=lnt; /// lantul din care apartine
        w[lnt].push_back(nod);
    }else { /// unim cu poz
        w[l[fiu]].push_back(nod);
        l[nod]=l[fiu];
        for (i=0;i<v[nod].size();i++){
            vecin=v[nod][i];
            if (vecin!=tt[nod] && vecin!=fiu)
                up[l[vecin]]=nod; /// din lantul vecinului trecem in lantul nodului
            d[vecin] = 0;
        }
    }
    v[nod].clear();
}
void build_aint (int lant , int p , int st , int dr){
    int mid = (st + dr)/2;

    if (st == dr){
        idx_aint[w[lant][st]] = p;
        return;
    }

    build_aint(lant , 2 * p , st , mid);
    build_aint(lant , 2 * p + 1 , mid + 1 , dr);


}
void update_aint (int lant , int p , int st , int dr , int l , int r){
    int mid , len , rest;
    if (st == dr){
        return;
    }
    mid=(st+dr)/2;
    if (l <= mid){
        update_aint(lant , 2 * p , st , mid , l , r);
    }
    if (mid + 1 <= r)
        update_aint(lant , 2 * p + 1 , mid + 1 , dr , l , r);
    for (len = 1 ; len <= 20 ; len++){
        for (rest = 0 ; rest < len ; rest++)
            aint[lant][p][code(len , rest)] = aint[lant][2 * p][code(len , rest)] + aint[lant][2 * p + 1][code(len , rest)];
    }
}
void update (int x , int y){
    if (l[x]!=l[y]){ /// avansam
        if (lvl[up[l[x]]]>lvl[up[l[y]]]){
            update ( up[l[x]] , y );

            update_aint (l[x] , 1 , 0 , w[l[x]].size()-1 , 0 , poz[x] );
        }
        else{
            update ( x , up[l[y]] );

            update_aint( l[y] , 1 , 0 , w[l[y]].size()-1 , 0 , poz[y] );
        }
    }
    else {
        update_aint( l[x] , 1 , 0 , w[l[x]].size()-1 , min(poz[x],poz[y]) , max(poz[x],poz[y]) );
    }
}
long long query_aint (int lant , int p , int st , int dr , int px , int py , int t1 , int t2){
    int mid , len , rest;
    long long sol = 0;
    if (px <= st && dr <= py){

        for (len = 1 ; len <= 20 ; len ++){
            for (rest = 0 ; rest < len ; rest++){
                sol += 1LL * aint[lant][p][code(len , rest)] * ( (t2 / len) + (t2 % len >= rest) - ((t1 - 1) / len) - ((t1 - 1) % len >= rest));
            }
        }

        return sol;
    }
    mid = (st + dr)/2;
    if (px <= mid)
        sol = sol + query_aint(lant , 2 * p , st , mid , px , py , t1 , t2);
    if (mid+1 <= py)
        sol = sol + query_aint(lant , 2 * p + 1 , mid + 1 , dr , px , py , t1 , t2);
    return sol;
}
long long query (int x , int y , int t1 , int t2){
    if (l[x] != l[y]){ /// avansam
        if (lvl[up[l[x]]]>lvl[up[l[y]]])
            return query(up[l[x]] , y , t1 , t2) + query_aint(l[x] , 1 , 0 , w[l[x]].size()-1 , 0 , poz[x] , t1 , t2);
        else{
            return query(x , up[l[y]] , t1 , t2) + query_aint(l[y] , 1 , 0 , w[l[y]].size()-1 , 0 , poz[y] , t1 , t2);
        }
    }
    else{
        return query_aint(l[x] , 1 , 0 , w[l[x]].size()-1 , min(poz[x],poz[y]) , max(poz[x],poz[y]) , t1 , t2);
    }
}
void adauga (int x , int y , int val , int op){
    int lca , nod , poz , len , i , nod1 , nod2;
    nod1 = x;
    nod2 = y;
    while (lvl[nod1] < lvl[nod2])
        nod2 = tt[nod2];
    while (lvl[nod1] > lvl[nod2])
        nod1 = tt[nod1];
    while (nod1 != nod2){

        nod1 = tt[nod1];
        nod2 = tt[nod2];

    }
    lca = nod1;
    len = lvl[x] + lvl[y] - 2 * lvl[lca] + 1;

    nod = x;
    poz = 0;
    while (nod != tt[lca]){
        aint[l[nod]][idx_aint[nod]][code(len , poz)] += val;
        poz++;
        nod = tt[nod];
    }

    nod = y;
    poz = len - 1;
    while (nod != lca){
        aint[l[nod]][idx_aint[nod]][code(len , poz)] += val;
        poz--;
        nod = tt[nod];
    }
}
int main()
{
    FILE *fin = stdin;
    FILE *fout = stdout;
    int n , i , x , y , tip , k , q , t1 , t2 , p , vecin;
    fscanf (fin,"%d",&n);
    for (i = 1 ; i < n ; i++){
        fscanf (fin,"%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }

    lvl[1] = 1;
    dfs_lant(1 , 0);

    /// fiecare nod al catelea e
    for (i=1;i<=lnt;i++){
        reverse(w[i].begin(),w[i].end());
        p=0;
        for (vector <int> :: iterator j=w[i].begin();j!=w[i].end();j++){
            /// pozitia lui din lantul curent
            vecin=*j;
            poz[vecin]=p;
            p++;
        }
        aint[i].resize(w[i].size()*4);
        build_aint(i , 1 , 0 , w[i].size() - 1);
    }


    fscanf (fin,"%d",&k);
    int op = 1;
    for (i = 1 ; i <= k ; i++){
        fscanf (fin,"%d%d",&x,&y);
        adauga(x , y , 1 , ++op);
        update(x , y);

    }
    fscanf (fin,"%d",&q);
    for (i = 1 ; i <= q ; i++){
        fscanf (fin,"%d",&tip);
        if (tip == 1){
            fscanf (fin,"%d%d",&x,&y);
            adauga(x , y , 1 , ++op);
            update (x , y);
        }
        else if (tip == 2){
            fscanf (fin,"%d%d",&x,&y);
            adauga(x , y , -1 , ++op);
            update (x , y);
        }
        else {
            fscanf (fin,"%d%d%d%d",&x,&y,&t1,&t2);
            fprintf (fout,"%lld\n",query (x , y , t1 , t2));
        }
    }
    return 0;
}

Compilation message

traffickers.cpp: In function 'void dfs_lant(int, int)':
traffickers.cpp:32:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0;i<v[nod].size();i++){
              ~^~~~~~~~~~~~~~
traffickers.cpp:52:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i=0;i<v[nod].size();i++){
                  ~^~~~~~~~~~~~~~
traffickers.cpp: In function 'void adauga(int, int, int, int)':
traffickers.cpp:140:33: warning: unused variable 'i' [-Wunused-variable]
     int lca , nod , poz , len , i , nod1 , nod2;
                                 ^
traffickers.cpp: In function 'int main()':
traffickers.cpp:177:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d",&n);
     ~~~~~~~^~~~~~~~~~~~~
traffickers.cpp:179:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%d%d",&x,&y);
         ~~~~~~~^~~~~~~~~~~~~~~~~~
traffickers.cpp:202:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d",&k);
     ~~~~~~~^~~~~~~~~~~~~
traffickers.cpp:205:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%d%d",&x,&y);
         ~~~~~~~^~~~~~~~~~~~~~~~~~
traffickers.cpp:210:12: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     fscanf (fin,"%d",&q);
     ~~~~~~~^~~~~~~~~~~~~
traffickers.cpp:212:16: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         fscanf (fin,"%d",&tip);
         ~~~~~~~^~~~~~~~~~~~~~~
traffickers.cpp:214:20: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             fscanf (fin,"%d%d",&x,&y);
             ~~~~~~~^~~~~~~~~~~~~~~~~~
traffickers.cpp:219:20: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             fscanf (fin,"%d%d",&x,&y);
             ~~~~~~~^~~~~~~~~~~~~~~~~~
traffickers.cpp:224:20: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             fscanf (fin,"%d%d%d%d",&x,&y,&t1,&t2);
             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 23 ms 8448 KB Output is correct
2 Correct 246 ms 27384 KB Output is correct
3 Correct 197 ms 21628 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3272 ms 170744 KB Output is correct
2 Execution timed out 3584 ms 128372 KB Time limit exceeded
3 Correct 2860 ms 191080 KB Output is correct
4 Execution timed out 3592 ms 160864 KB Time limit exceeded
5 Execution timed out 3577 ms 142524 KB Time limit exceeded
6 Execution timed out 3584 ms 151160 KB Time limit exceeded
7 Execution timed out 3593 ms 159692 KB Time limit exceeded
8 Correct 2876 ms 200524 KB Output is correct
9 Correct 2928 ms 207608 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 3588 ms 424908 KB Time limit exceeded
2 Execution timed out 3599 ms 512852 KB Time limit exceeded
3 Runtime error 2789 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Execution timed out 3588 ms 349380 KB Time limit exceeded
5 Execution timed out 3566 ms 303544 KB Time limit exceeded
6 Runtime error 2944 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Runtime error 2482 ms 524292 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Runtime error 2533 ms 524288 KB Execution killed with signal 9 (could be triggered by violating memory limits)