제출 #1166688

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1166688		8pete8	즐거운 행로 (APIO20_fun)	C++20	26 / 100	51 ms	13640 KiB

fun

#include "fun.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
#define sz(x) (int)((x).size())
const int mxn=1e3;
vector<int>adj[mxn+10];
int done[mxn+10],dist[mxn+10][mxn+10];
pii st;
void getdist(int cur,int p,int root){
  st=max(st,{dist[root][cur],root});
  for(auto i:adj[cur])if(i!=p){
    dist[root][i]=dist[root][cur]+1;
    getdist(i,cur,root);
  }
}
vector<int> createFunTour(int n, int q){
  vector<int>ans;
  for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)if(hoursRequired(i,j)==1){
    adj[i].pb(j);
    adj[j].pb(i);
  }
  st={-1,0};
  for(int i=0;i<n;i++)getdist(i,-1,i);
  while(ans.size()<n){
    int cur=st.s;
    ans.pb(cur);
    done[cur]=1;
    st={-1,0};
    for(int j=0;j<n;j++)if(!done[j])st=max(st,{dist[cur][j],j});
  }
  return ans;
}

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

fun.cpp:33:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   33 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
fun.cpp:39:36: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   39 | void getdist(int cur,int p,int root){
      |                                    ^
fun.cpp:46:39: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   46 | vector<int> createFunTour(int n, int q){
      |                                       ^

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