제출 #1120837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120837		vjudge1	Art Collections (BOI22_art)	C++17	0 / 100	3 ms	2640 KiB

art

#include "art.h"
#include <bits/stdc++.h>
using namespace std;
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
//     art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
//     g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//

const int maxn = 1e5 + 10;

int id[maxn], cnt[maxn];
vector <int> g[maxn];
queue <int> q;

void dfs(int v) {
	for (auto to: g[v]) {
		id[to] = id[v] + 1;
		dfs(to);
	}
}
vector <int> d;

void solve(int n) {
	vector <int> order;
	for (int i = 1; i <= n; i++) {
		order.push_back(i);
	}
	int ans = publish(order);
	for (int i = order.size() - 2; i >= 0; i--) {
		int x = order[i];
		for (int j = i; j + 1 < order.size(); j++) {
			swap(order[j], order[j + 1]);
		}
		int sum = publish(order);
		// for (int j = 0; j < order.size(); j++) {
	// 		cout << order[j] << " ";
	// 	}
	// 	cout << '\n';
	// 	cout << sum << '\n';
		d.clear();
		for (int j = i; j < order.size() - 1; j++) {
			d.push_back(order[j]);
		}
		int sz = order.size();
		for (int j = i; j < sz; j++) {
			order.pop_back();
		}
		
		sz = d.size();
		int df = sum - ans;
		int y = (df - sz) / -2;
		int z = sz - y;
		ans -= y;
		ans += z;
		for (int j = 0; j < y; j++) {
			order.push_back(d[j]);
		}
		order.push_back(x);
		for (int j = y; j < d.size(); j++) {
			order.push_back(d[j]);
		}
		
	}
	answer(order);
}

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

art.cpp: In function 'void solve(int)':
art.cpp:39:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |   for (int j = i; j + 1 < order.size(); j++) {
      |                   ~~~~~~^~~~~~~~~~~~~~
art.cpp:49:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for (int j = i; j < order.size() - 1; j++) {
      |                   ~~^~~~~~~~~~~~~~~~~~
art.cpp:67:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |   for (int j = y; j < d.size(); j++) {
      |                   ~~^~~~~~~~~~
interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30