提出 #17176607

---

ソースコード 拡げる

//Jai Sai Ram 
// Please help me in every situation 
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl "\n"
vector<pair<ll,ll>> adj[400001];
ll vis[400001][4],dis[400001],ending[400001];
bool check(vector<pair<ll,ll>> vp)
{
    ll ans=true;
    map<ll,ll> mp;
    for(ll i=0;i<vp.size();i++)
    {
        if(vp[i].second!=-1&&vp[i].second<=vp[i].first)
        return false;
        if(mp[vp[i].first]>0&&vp[i].first!=-1)
        return false;
        if(mp[vp[i].second]>0&&vp[i].second!=-1)
        return false;
        mp[vp[i].second]++;
        mp[vp[i].first]++;
    }
    return true;
}
void solve()
{
    ll i,j,k,l,m,n,o;
    cin>>n;
    ll auxi[3*n+1];
    memset(auxi,-1,sizeof(auxi));
    vector<pair<ll,ll>> vp;
    map<ll,ll> start,end;
    o=0;
    set<pair<ll,ll>> known;
    for(i=1;i<=n;i++)
    {
        cin>>j>>k;
        vp.push_back({j,k});
        if(j!=-1&&k==-1)
        start[j]=i;
        if(k!=-1&&j==-1)
        end[k]=i;
        if(j==-1&&k==-1)
        vp.pop_back();
        if(j!=-1&&k!=-1)
        {
        o++;
        known.insert({j,k});
        }
    }
    if(!check(vp))
    {
    cout<<"No\n";
    return;
    }
    if(check(vp)&&o<=1)
    {
        cout<<"Yes\n";
        return ;
    }
    //cout<<check(vp)<<" "<<o<<endl;
    ll flag=0;
    set<ll> done;
    while(!known.empty())
    {
         auto it=*known.begin();
         ll u=it.first;
         ll v=it.second;
         known.erase(it);
         if(it.first<=0||it.second>2*n)
         {flag=1;
         break;}
         done.insert(start[u]);
         done.insert(end[v]);
         ll val=v-u-1;
         for(k=u;k<=v;k++)
         {
             if(auxi[k]!=-1)
             {
                 if(auxi[k]!=val)
                 {
                 flag=1;
                 break;
                 }
                 
             }
             auxi[k]=val;
             if(start[k]!=0)
             {
                 if(done.find(start[k])==done.end())
                 known.insert({k,k+val+1});
                 else 
                 flag=1;
             }
             else if(end[k]!=0)
             {
                 if(done.find(end[k])==done.end())
                 known.insert({k-val-1,k});
                 else 
                 flag=1;
             }
         }
         if(flag)
         break;
    }
    if(flag==1)
    {
        cout<<"No\n";
        return;
    }
    else 
    {
        for(i=1;i<=n;i++)
        {
            if(done.find(i)==done.end())
            {
                j=vp[i-1].first;
                k=vp[i-1].second;
                if(j!=-1&&k==-1)
                {
                    if(end[j+1]>0&&done.find(end[j+1])!=done.end())
                    {
                        if(auxi[j-1]!=-1&&auxi[j+2]!=-1)
                        {
                            if(auxi[j-1]!=auxi[j+2])
                            flag=1;
                        }
                    }
                }
            }
        }
        if(flag)
        cout<<"No\n";
        else 
        cout<<"Yes\n";
    }
}

int main()
{
    ll t=1;
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll i=1;
   // cin>>t;
    while(t--)
    {
        solve();
        i++;
    }
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘bool check(std::vector<std::pair<long long int, long long int> >)’:
./Main.cpp:13:17: warning: comparison of integer expressions of different signedness: ‘ll’ {aka ‘long long int’} and ‘std::vector<std::pair<long long int, long long int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   13 |     for(ll i=0;i<vp.size();i++)
      |                ~^~~~~~~~~~
./Main.cpp:11:8: warning: unused variable ‘ans’ [-Wunused-variable]
   11 |     ll ans=true;
      |        ^~~
./Main.cpp: In function ‘void solve()’:
./Main.cpp:28:14: warning: unused variable ‘l’ [-Wunused-variable]
   28 |     ll i,j,k,l,m,n,o;
      |              ^
./Main.cpp:28:16: warning: unused variable ‘m’ [-Wunused-variable]
   28 |     ll i,j,k,l,m,n,o;
      |                ^

ジャッジ結果