Submission #290893

#	Time	Username	Problem	Language	Result	Execution time	Memory
290893		beso123	Fun Tour (APIO20_fun)	C++14	66 / 100	323 ms	22000 KiB

fun

#include "fun.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define x first
#define y second
using namespace std;
vector<int> get_pas(priority_queue<pii> s1,priority_queue<pii> s2){
 vector<int> ans;
    int d=1;
if(s2.size()>s1.size())
    d=2;
while(true){
        pii v;
    if(d==1){
        v=s1.top();
        s1.pop();
        ans.push_back(v.y);
    }
    else{
    v=s2.top();
        s2.pop();
        ans.push_back(v.y);
    }
    d=3-d;
    if(s1.size()==0 && s2.size()==0)
        break;
}
return ans;
}
vector<int> off(priority_queue<pii> s1,priority_queue<pii> s2,priority_queue<pii> s3,int cur){
    vector<int> p,d;
    if(cur==0){
              while(!s2.empty()){
            s1.push(s2.top());
            s2.pop();
            }
        if(s1.top().x<s3.top().x)
            swap(s1,s3);
        return get_pas(s1,s3);
    }
    if(cur==1 || cur==2){
            pii f,s;
        if(cur==1){
            f=s2.top();
            s=s3.top();
            if(f.x>s.x){
                p.push_back(f.y);
                s2.pop();
            }
            while(!s2.empty()){
            s1.push(s2.top());
            s2.pop();
            }
            d=get_pas(s3,s1);
        }
        else{
            f=s1.top();
            s=s3.top();
            if(f.x>s.x){
                p.push_back(f.y);
                s1.pop();

            }
             while(!s2.empty()){
            s1.push(s2.top());
            s2.pop();
            }
            d=get_pas(s3,s1);
        }
    }
    else{
             while(!s2.empty()){
            s1.push(s2.top());
            s2.pop();
            }
        return get_pas(s1,s3);
    }
    for(int k=0;k<d.size();k++)
        p.push_back(d[k]);
    return p;

}
vector<int> createFunTour(int n,int Q1){
    if(n==2){
        return {0,1};
    }
int cnt=0,csize=INT_MAX;
for(int k=1;k<n;k++){
    int Size=attractionsBehind(0,k);
    if((Size-1)>=(n/2)){
        if(Size<csize){
            csize=Size;
            cnt=k;
        }
    }
}
vector<int> dist(n,0);
vector<int> P,al;
for(int k=0;k<n;k++){
    if(k==cnt)
        continue;
al.push_back(k);
    dist[k]=hoursRequired(k,cnt);
    if(dist[k]==1)
        P.push_back(k);
}
priority_queue<pii> s1,s2,s3;
for(int k=0;k<al.size();k++){
    int a=al[k];
    if(dist[a]==hoursRequired(P[0],a)+1){
            al[k]++;
        al[k]*=-1;
        s1.push({dist[a],a});
    }
}
for(int k=0;k<al.size();k++){
        if(al[k]<0)
        continue;
    int a=al[k];
    if(dist[a]==hoursRequired(P[1],a)+1){
            al[k]++;
        al[k]*=-1;
        s2.push({dist[a],a});
    }
}
if(P.size()!=2){
   for(int k=0;k<al.size();k++){
        if(al[k]<0)
        continue;
    int a=al[k];
    s3.push({dist[a],a});
}
}
vector<int> ans;
vector<int> p;

if(P.size()==2){
    ans=get_pas(s1,s2);
}
else{
    int cur=0;
      while(true){
        int a=s1.size(),b=s2.size(),c=s3.size();
   if(a+b==c){
     p=off(s1,s2,s3,cur);
    break;
   }
      if(c+b==a){
            if(cur==1)
            cur=3;
      else if(cur==3)
        cur=1;
    p=off(s3,s2,s1,cur);
    break;
   }
      if(a+c==b){
            if(cur==3)
            cur=2;
      else if(cur==2)
        cur=3;
    p=off(s1,s3,s2,cur);
    break;
   }
    pii v1=s1.top(),v2=s2.top(),v3=s3.top();
    if(cur==1)
        v1.x=-1;
        else
    if(cur==2)
        v2.x=-1;
        else
    if(cur==3)
        v3.x=-1;
    int mn=max(v1.x,max(v2.x,v3.x));
    if(mn==v1.x){
        ans.push_back(v1.y);
        cur=1;
        s1.pop();
    }
    else
        if(mn==v2.x){
        ans.push_back(v2.y);
        cur=2;
        s2.pop();
    }
    else
        if(mn==v3.x){
        ans.push_back(v3.y);
        cur=3;
        s3.pop();
    }
    }
}
for(int k=0;k<p.size();k++)
    ans.push_back(p[k]);
ans.push_back(cnt);
return ans;
}

Compilation message (stderr)

fun.cpp: In function 'std::vector<int> off(std::priority_queue<std::pair<int, int> >, std::priority_queue<std::pair<int, int> >, std::priority_queue<std::pair<int, int> >, int)':
fun.cpp:78:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(int k=0;k<d.size();k++)
      |                 ~^~~~~~~~~
fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:108:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 | for(int k=0;k<al.size();k++){
      |             ~^~~~~~~~~~
fun.cpp:116:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 | for(int k=0;k<al.size();k++){
      |             ~^~~~~~~~~~
fun.cpp:127:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |    for(int k=0;k<al.size();k++){
      |                ~^~~~~~~~~~
fun.cpp:193:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  193 | for(int k=0;k<p.size();k++)
      |             ~^~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 19 / 19
• Subtask 5: 0 / 34