Submission #468772

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
468772	2021-08-29T14:48:51 Z	nicolaalexandra	Traffic (CEOI11_tra)	C++14	82 / 100	5000 ms	65848 KB

#include <bits/stdc++.h>
#define DIM 300010
#define INF 2000000000
using namespace std;

vector <int> L[DIM],inv[DIM],est,vest;
vector <pair<int,int> > d;
int f[DIM],viz[DIM],sol[DIM],dr[DIM],st[DIM];
pair <int,int> pct[DIM];
deque <int> c;
int n,m,a,b,x,y,i,j,val,maxi,mini,poz,ok;

void dfs (int nod){
    viz[nod] = 1;
    if (f[nod] == 2){
        if (pct[nod].second > maxi)
            maxi = pct[nod].second, poz = nod;
    }
    for (auto vecin : L[nod]){
        if (!viz[vecin])
            dfs (vecin);
    }
}

void dfs2 (int nod){
    viz[nod] = val;
    if (f[nod] == 2){
        if (pct[nod].second < mini)
            mini = pct[nod].second, poz = nod;
    }
    for (auto vecin : L[nod]){
        if (!viz[vecin])
            dfs2 (vecin);
    }
}

inline int cmp (int a, int b){
    return pct[a].second < pct[b].second;
}

int cautare_binara (vector<int> v, int x){

    int st = 0, dr = v.size()-1;
    while (st <= dr){
        int mid = (st+dr)>>1;
        if (pct[v[mid]].second == pct[x].second)
            return mid;
        if (pct[v[mid]].second < pct[x].second)
            st = mid+1;
        else dr = mid-1;
    }

}

int main (){

    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

    cin>>n>>m>>a>>b;
    for (i=1;i<=n;i++){
        cin>>pct[i].first>>pct[i].second;
        if (pct[i].first == 0)
            f[i] = 1; /// vest
        if (pct[i].first == a)
            f[i] = 2; /// est
    }

    for (i=1;i<=m;i++){
        cin>>x>>y>>val;
        L[x].push_back(y);
        inv[y].push_back(x);
        if (val == 2){
            L[y].push_back(x);
            inv[x].push_back(y);
        }
    }

    /// pastrez doar nodurile din dreapta care sunt reachable din stanga

    for (i=1;i<=n;i++)
        if (f[i] == 1){
            c.push_back(i);
            viz[i] = 1;
        }

    while (!c.empty()){
        int nod = c.front();
        c.pop_front();
        for (auto vecin : L[nod]){
            if (!viz[vecin]){
                viz[vecin] = 1;
                c.push_back(vecin);
            }}}

    for (i=1;i<=n;i++)
        if (f[i] == 2 && viz[i])
            est.push_back(i);

    /// pastrez in stanga doar nodurile care conteaza si din care pot sa ajung in dr

    c.clear();
    memset (viz,0,sizeof viz);
    for (i=1;i<=n;i++)
        if (f[i] == 2){
            c.push_back(i);
            viz[i] = 1;
        }
    while (!c.empty()){
        int nod = c.front();
        c.pop_front();
        for (auto vecin : inv[nod]){
            if (!viz[vecin]){
                viz[vecin] = 1;
                c.push_back(vecin);
            }}}

    for (i=1;i<=n;i++)
        if (f[i] == 1 && viz[i])
            vest.push_back(i);


    sort (vest.begin(),vest.end(),cmp);

    memset (viz,0,sizeof viz);
    for (int i=0;i<vest.size();i++){
        maxi = -INF, poz = 0;
        dfs (vest[i]);
        if (poz)
            dr[i] = poz;
        else dr[i] = dr[i-1];
    }

    memset (viz,0,sizeof viz);

    for (int i=vest.size()-1;i>=0;i--){
        mini = INF, poz = 0;
        dfs2 (vest[i]);
        if (poz)
            st[i] = poz;
        else st[i] = st[i+1];
    }

    sort (est.begin(),est.end(),cmp);

    for (i=0;i<vest.size();i++)
        sol[vest[i]] = cautare_binara (est,dr[i]) - cautare_binara (est,st[i]) + 1;

    for (i=1;i<=n;i++)
        if (f[i] == 1)
            d.push_back(make_pair(pct[i].second,sol[i]));

    sort (d.begin(),d.end());
    reverse(d.begin(),d.end());
    for (auto it : d)
        cout<<it.second<<"\n";


    return 0;
}

Compilation message

tra.cpp: In function 'int main()':
tra.cpp:126:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |     for (int i=0;i<vest.size();i++){
      |                  ~^~~~~~~~~~~~
tra.cpp:146:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |     for (i=0;i<vest.size();i++)
      |              ~^~~~~~~~~~~~
tra.cpp: In function 'int cautare_binara(std::vector<int>, int)':
tra.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
   53 | }
      | ^

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	15564 KB	Output is correct
2	Correct	9 ms	15564 KB	Output is correct
3	Correct	9 ms	15564 KB	Output is correct
4	Correct	9 ms	15564 KB	Output is correct
5	Correct	9 ms	15564 KB	Output is correct

Subtask #2
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	15564 KB	Output is correct
2	Correct	9 ms	15564 KB	Output is correct
3	Correct	9 ms	15564 KB	Output is correct

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	15564 KB	Output is correct
2	Correct	10 ms	15564 KB	Output is correct
3	Correct	10 ms	15552 KB	Output is correct

Subtask #4
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	15720 KB	Output is correct
2	Correct	19 ms	16076 KB	Output is correct
3	Correct	18 ms	15952 KB	Output is correct

Subtask #5
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	46 ms	16580 KB	Output is correct
2	Correct	219 ms	21200 KB	Output is correct
3	Correct	73 ms	18240 KB	Output is correct

Subtask #6
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	101 ms	18372 KB	Output is correct
2	Correct	271 ms	22864 KB	Output is correct
3	Correct	128 ms	20656 KB	Output is correct

Subtask #7
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	213 ms	20964 KB	Output is correct
2	Correct	590 ms	27844 KB	Output is correct
3	Correct	421 ms	28128 KB	Output is correct

Subtask #8
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	316 ms	22608 KB	Output is correct
2	Correct	506 ms	27676 KB	Output is correct
3	Correct	541 ms	28740 KB	Output is correct

Subtask #9
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	488 ms	26420 KB	Output is correct
2	Correct	3750 ms	36400 KB	Output is correct
3	Correct	890 ms	39820 KB	Output is correct

Subtask #10
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	767 ms	32460 KB	Output is correct
2	Execution timed out	5066 ms	48924 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #11
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1526 ms	44100 KB	Output is correct
2	Execution timed out	5064 ms	50756 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #12
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	509 ms	26436 KB	Output is correct
2	Correct	4818 ms	54452 KB	Output is correct
3	Correct	1338 ms	51896 KB	Output is correct
4	Correct	1826 ms	65848 KB	Output is correct