제출 #348024

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
348024		beksultan04	Split the Attractions (IOI19_split)	C++14	0 / 100	110 ms	14304 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin()Ñ,s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
vector <int> v;
bool vis[100001];
vector <int> g[100001];
void dfs(int x,int p){
    vis[x]=1;
    for (int to : g[x]){
        if (to != p && vis[to] == 0)dfs(to,x);
    }
    v.pb(x);
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> res;

	int i,j,s=0;
	for (i=0;i<p.size();++i){
        g[p[i]].pb(q[i]);
        g[q[i]].pb(p[i]);
	}
	for (i=0;i<n;++i){
        if (g[i].size() == 1){
            s = i;
        }
	}
	dfs(s,-1);
	for (i=0;i<v.size();++i){
        if (i < a)res.pb(1);
        else if (i < a+b)res.pb(2);
        else res.pb(3);
	}
	return res;
}

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

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:38:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for (i=0;i<p.size();++i){
      |           ~^~~~~~~~~
split.cpp:48:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  for (i=0;i<v.size();++i){
      |           ~^~~~~~~~~
split.cpp:37:8: warning: unused variable 'j' [-Wunused-variable]
   37 |  int i,j,s=0;
      |        ^

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36