제출 #762672

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
762672		vjudge1	Fun Tour (APIO20_fun)	C++17	0 / 100	1 ms	300 KiB

fun

#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>

const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;

ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (PPCM)

// HERE IS THE SOLUTION
int hoursRequired(int x , int y);
int attractionsBehind(int x , int y);
vi createFunTour(int n , int q)
{
    map<pair<int,int> , int> dist;
    int diam = 0;
    fore(i , n)
    {
        forr(j, i + 1 , n - 1)
        {
            dist[{i , j}] = hoursRequired(i , j);
            diam = max(diam , dist[{i , j}]);
        }
    }
    int a;
    fore(i , n)
    {
        forr(j , i + 1 , n - 1)
        {
            if(dist[{i , j}] == diam)
            {
                a = i;
                break;
            }
        }
    }
    vi ans;
    while(sz(ans) < n)
    {
        ans.pb(a);
        int ndiam = 0;
        fore(i , n)
        {
            ndiam = max(ndiam  , dist[{min(a,i) , max(a,i)}]);
        }
        fore(i , n)
        {
            if(ndiam == dist[{min(a,i) , max(a,i)}])
            {
                a = i;
                break;
            }
        }
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:59:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |     while(sz(ans) < n)
      |                   ^

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