제출 #241728

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241728		crossing0ver	Unscrambling a Messy Bug (IOI16_messy)	C++17	0 / 100	2099 ms	384 KiB

messy

#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
int X[500],L[500],R[500],IN[500];
vector<int> restore_permutation(int n, int w, int r) {
	int lg = log2(n);
	int l = -1;
	string s(n,'0');
	for (int val = n/2;val;val/=2) {
		for (int i = l+1; i < n; i++) {
			if ( (i & ( val) ) == 0)	{
				s[i] = '1';
				//add_element(s);
				cout << s <<'\n';
				s[i] = '0';
			}
		}
		s[++l] = '1';
	}
    compile_set();
    for (int i = 0;i < n; i++) s[i] = '0';
    vector<int> st;
    vector<int> not1;
    for (int i = 0; i < n; i++) not1.push_back(i);
    int val = n/2;
    int cnt = 0;
    for (int i = 0; i < n; i++)
    for (int j = 1; j < n; j*=2) X[i]^=(1 << j);
    while (val) {
    	vector<int> v;
    for (int i = 0; i < n; i++) {
    	s[i] = '1';
    	if (!IN[i] && check_element(s)){
    		v.push_back(i);
    		X[i]^=val;
    		not1.erase(find(not1.begin(),not1.end(),i));
		}	
    	s[i] = '0';
	}
	cnt++;
	vector<bool> vis(n+1);
	while (not1.size()) {
		int pos = rand()%not1.size();
		bool flag = 0;
		for (int i : v) {
			int t = 4;
			int pos = rand()%not1.size();
			s[pos] = 1;
			s[i]   = 1;
			if (check_element(s)) {
				flag = 1;
				s[i] = pos;
				IN[i] = 1;
				break;
			}
		}
	if (flag) break;
	}
	}
	vector<int> ans;
   for (int i = 0;i < n; i++)
   		ans.push_back(X[i]);
}
/*
main(){
	int n;
	cin >> n;
	restore_permutation(n,0,0);
}*/

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

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:46:8: warning: unused variable 't' [-Wunused-variable]
    int t = 4;
        ^
messy.cpp:43:7: warning: unused variable 'pos' [-Wunused-variable]
   int pos = rand()%not1.size();
       ^~~
messy.cpp:6:6: warning: unused variable 'lg' [-Wunused-variable]
  int lg = log2(n);
      ^~
messy.cpp:63:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• Subtask 1: 0 / 20
• Subtask 2: 0 / 18
• Subtask 3: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30