oj.uz

답안 #277563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
277563 2020-08-21T05:57:14 Z 임성재(#5118) Travelling Salesperson (CCO20_day2problem1) C++17
0 / 25
 621 ms 35976 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define all(v) (v).begin(), (v).end()

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int inf = 1e9;
const ll INF = 1e18;

int n;
int g[2010][2010];
vector<int> ans;

void f(int r) {
	int s = r == 1 ? 2 : 1;

	list<int> l;
	
	l.push_back(s);
	auto it = l.begin();

	for(int i=1; i<=n; i++) {
		if(i == r || i == s) continue;

		int m = *it;

		if(g[m][i] == 1) {
			if(it == l.end()) l.push_back(i);
			else {
				l.insert(next(it), i);
			}

			it++;
			if(it != l.end() && g[*next(it)][*it] == 1) it++;
		}
		else {
			l.insert(it, i);
			it--;
			if(it != l.begin() && g[*prev(it)][*it] == 2) it--;
 		}
	}

	ans.clear();
	for(auto i : l) ans.eb(i);
	
	if(g[ans.front()][ans.back()] == 2) {
		reverse(ans.begin()+1, ans.end());
		reverse(all(ans));
	}

	if(g[ans.back()][r] == 1) reverse(ans.begin(), ans.end()-1);

	reverse(all(ans));

	cout << ans.size() + 1 << "\n";
	cout << r << " ";
	for(auto i : ans) {
		cout << i << " ";
	}
	cout << "\n";
}

int main() {
	fast;

	cin >> n;

	for(int i=2; i<=n; i++) {
		string s;
		cin >> s;

		for(int j=1; j<i; j++) {
			g[i][j] = g[j][i] = (s[j-1] == 'R') + 1;
		}
	}

	for(int i=1; i<=n; i++) {
		f(i);
	}
}

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Incorrect 621 ms 35976 KB Output isn't correct
17 Halted 0 ms 0 KB -