oj.uz

답안 #598260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
598260 2022-07-17T21:18:38 Z ogibogi2004 즐거운 행로 (APIO20_fun) C++14
0 / 100
 1 ms 320 KB 
#include "fun.h"

#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int MAXN=1e5;
int st[MAXN];
int dep[MAXN];
vector<int> createFunTour(int N, int Q) {
    for(int i=1;i<N;i++)
    {
        st[i]=attractionsBehind(i,0);
    }
    st[0]=N;
    int centr=0,minst=N;
    for(int i=1;i<N;i++)
    {
        if(st[i]>=N/2)
        {
            if(st[i]<minst)
            {
                minst=st[i];
                centr=i;
            }
        }
    }
    vector<int>dep1;
    vector<pair<int,int> >buckets[3];
    for(int i=0;i<N;i++)
    {
        dep[i]=hoursRequired(i,centr);
        if(dep[i]==1)dep1.push_back(i);
    }
    for(int j=0;j<dep1.size();j++)buckets[j].push_back({1,dep1[j]});
    for(int i=0;i<N;i++)
    {
        if(dep[i]<=1)continue;
        for(int j=0;j<dep1.size();j++)
        {
            if(dep[i]==hoursRequired(dep1[j],i)+1)
            {
                buckets[j].push_back({dep[i],i});
                break;
            }
        }
    }
    if(dep1.size()==1)
    {
        return {0,1};
    }
    vector<int>ans;
    if(dep1.size()==2)
    {
        sort(buckets[0].rbegin(),buckets[0].rend());
        sort(buckets[1].rbegin(),buckets[1].rend());
        if(buckets[0].size()<buckets[1].size())swap(buckets[0],buckets[1]);

        for(int i=0;i<buckets[1].size();i++)
        {
            ans.push_back(buckets[0][i].second);
            ans.push_back(buckets[1][i].second);
        }
        if(buckets[0].size()>buckets[1].size())
        {
            ans.push_back(buckets[0].back().second);
        }
        ans.push_back(centr);
        return ans;
    }
    else
    {
        if(buckets[1].size()>buckets[0].size())swap(buckets[0],buckets[1]);
        if(buckets[2].size()>buckets[0].size())swap(buckets[0],buckets[2]);
        int t=0;
        sort(buckets[0].begin(),buckets[0].end());
        sort(buckets[1].begin(),buckets[1].end());
        sort(buckets[2].begin(),buckets[2].end());
        while(buckets[0].size()!=buckets[1].size()+buckets[2].size())
        {
            ans.push_back(buckets[t].back().second);
            buckets[t].pop_back();
            t++;t%=3;
        }
        if(t==2)t=0;
        for(auto xd:buckets[2])buckets[1].push_back(xd);
        sort(buckets[1].rbegin(),buckets[1].rend());
        sort(buckets[0].rbegin(),buckets[0].rend());
        if(t==1)swap(buckets[0],buckets[1]);
        for(int j=0;j<buckets[0].size();j++)
        {
            ans.push_back(buckets[0][j].second);
            ans.push_back(buckets[1][j].second);
        }
        ans.push_back(centr);
        return ans;
    }
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:34:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for(int j=0;j<dep1.size();j++)buckets[j].push_back({1,dep1[j]});
      |                 ~^~~~~~~~~~~~
fun.cpp:38:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for(int j=0;j<dep1.size();j++)
      |                     ~^~~~~~~~~~~~
fun.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for(int i=0;i<buckets[1].size();i++)
      |                     ~^~~~~~~~~~~~~~~~~~
fun.cpp:89:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(int j=0;j<buckets[0].size();j++)
      |                     ~^~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 320 KB Invalid size
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 320 KB Invalid size
4 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 320 KB Invalid size
3 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 320 KB Invalid size
3 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 320 KB Invalid size
4 Halted 0 ms 0 KB -