oj.uz

Submission #1040088

# Submission time Handle Problem Language Result Execution time Memory
1040088 2024-07-31T15:57:26 Z Marco_Escandon Event Hopping (BOI22_events) C++11
0 / 100
 1500 ms 524288 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const string ny[2] = {"No", "Yes"};
#define x first
#define y second
vector<vector<ll>> G(200000);
vector<vector<ll>> v;
ll cmc(ll n,ll ini,ll b)
{
    if(v[ini].size()!=0) return v[ini][b];
    v[ini].assign(n+2, 1e9);
    priority_queue<pair<ll,ll>>q;
    q.push({0,ini});
    while(!q.empty())
    {
        pair<ll,ll> a=q.top();q.pop();
        if(v[ini][a.y]==1e9)
        {
            v[ini][a.y]=-a.x;
            for(auto i:G[a.y])
                if(v[ini][i]==1e9)
                    q.push({a.x-1,i});
        }
    }
    return v[ini][b];
};
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    ll n,q;
    cin>>n>>q;
    v.resize(n+2);
    vector<pair<ll,ll>> cad;
    vector<pair<ll,ll>> input;input.push_back({0,0});
    for(int i=1; i<=n; i++)
    {
        ll a,b;
        cin>>a>>b;
        input.push_back({a,b});
        cad.push_back({a,i});
        cad.push_back({b,i});
    }
    sort(cad.begin(),cad.end());
    set<ll> s;
    for(int i=0; i<cad.size(); i++)
    {
        vector<ll> temp,temp2;
        ll a=i;
        while(i<cad.size()&&cad[a].x==cad[i].x){
            temp.push_back(cad[i].y);
            i++;
        }
        i--;
        for(auto j:temp)
        {
            if(s.find(j)!=s.end())
                temp2.push_back(j);
            else s.insert(j);
        }
        for(auto j:temp2) for(auto k:s) G[j].push_back(k);
        for(auto j:temp2) if(s.find(j)!=s.end()) s.erase(j);
    }
    for(int i=1; i<=n; i++)
    {
        cmc(n,i,i);
    }
    for(int i=0; i<q; i++)
    {
        ll a,b;
        cin>>a>>b;
        if(input[a].y>input[b].y){ cout<<"impossible"<<"\n"; continue;}
        a=cmc(n,a,b);
        if(a==1e9) cout<<"impossible"<<"\n";
        else cout<<a<<"\n";
    }
    return 0;
}

Compilation message

events.cpp: In function 'int main()':
events.cpp:48:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i=0; i<cad.size(); i++)
      |                  ~^~~~~~~~~~~
events.cpp:52:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int>, std::allocator<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         while(i<cad.size()&&cad[a].x==cad[i].x){
      |               ~^~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Execution timed out 1611 ms 516224 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 19 ms 12984 KB Output is correct
4 Correct 10 ms 12892 KB Output is correct
5 Correct 18 ms 13104 KB Output is correct
6 Correct 1038 ms 15120 KB Output is correct
7 Execution timed out 1516 ms 13864 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 19 ms 12984 KB Output is correct
4 Correct 10 ms 12892 KB Output is correct
5 Correct 18 ms 13104 KB Output is correct
6 Correct 1038 ms 15120 KB Output is correct
7 Execution timed out 1516 ms 13864 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 19 ms 12984 KB Output is correct
4 Correct 10 ms 12892 KB Output is correct
5 Correct 18 ms 13104 KB Output is correct
6 Correct 1038 ms 15120 KB Output is correct
7 Execution timed out 1516 ms 13864 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1593 ms 524288 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Execution timed out 1611 ms 516224 KB Time limit exceeded
3 Halted 0 ms 0 KB -