제출 #1069870

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069870		Abito	Brought Down the Grading Server? (CEOI23_balance)	C++17	10 / 100	54 ms	452 KiB

balance

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int N=20+5;
int n,t,s,f[2][N];
vector<int> a[N];
int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	cin>>n>>s>>t;
	for (int i=0;i<n;i++){
		a[i].resize(s);
		for (int j=0;j<s;j++) cin>>a[i][j];
	}
	for (int mask=0;mask<(1<<n);mask++){
		for (int i=0;i<n;i++) if (mask&(1<<i)) swap(a[i][0],a[i][1]);
		memset(f,0,sizeof(f));
		for (int i=0;i<n;i++) f[0][a[i][0]]++,f[1][a[i][1]]++;
		bool ok=true;
		for (int i=1;i<=t;i++) ok&=(abs(f[0][i]-f[1][i])<=1);
		if (ok){
			for (int i=0;i<n;i++){
				for (int j=0;j<2;j++) cout<<a[i][j]<<' ';
				cout<<endl;
			}
			return 0;
		}
		for (int i=0;i<n;i++) if (mask&(1<<i)) swap(a[i][0],a[i][1]);
	}
	return 0;
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2-1: 0 / 15
• Subtask 2-2: 0 / 5
• Subtask 2-3: 0 / 5
• Subtask 3-1: 0 / 15
• Subtask 3-2: 0 / 5
• Subtask 3-3: 0 / 5
• Subtask 4-1: 0 / 20
• Subtask 4-2: 0 / 10
• Subtask 4-3: 0 / 10