oj.uz

답안 #79590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
79590 2018-10-15T03:58:01 Z AngelKnows 사육제 (CEOI14_carnival) C++14
100 / 100
 11 ms 688 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,n) for (int i=1;i<=n;i++)
#define REP(i,a,b) for (int i=a;i<=b;i++)
 
#define pb push_back
#define fi first
#define se second
#define pi pair<int,int>
#define mp make_pair
#define sz(x) ((int)(x).size())
 
typedef long long ll;

const int inf=0x3f3f3f3f;
const ll linf=1e18;
const int N=150+10;
const double eps=1e-5;
const int mo=1e9+7;

int n;
int a[N];
int b[N];
// b[i]=j表示将颜色i替换成j 
bool used[N];
void ask(int l,int r,int x) {
	int len=r-l+1+1;
	printf("%d ",len);
	REP(i,l,r) printf("%d ",i);
	printf("%d\n",x);
	fflush(stdout);
}
int count(int l,int r) {
	memset(used,0,sizeof used);
	int res=0;
	REP(i,l,r) if (!used[a[i]]) {
		used[a[i]]=1;
		res++;
	}
	return res;
}
void solve(int l,int r) {
	if (l==r) {
		a[l]=1;
		return;
	}
	int mid=(l+r)>>1;
	solve(l,mid);
	solve(mid+1,r);
	int ans,tot,now;
	memset(b,0,sizeof b);
	now=count(l,mid);
	REP(i,mid+1,r) if (!b[a[i]]) {
		ask(l,mid,i);
		scanf("%d",&ans);
		tot=count(l,mid);
		if (ans==tot+1) {
			b[a[i]]=++now;
		} else if (l==mid) {
			b[a[i]]=a[l];
		} else {
			int L=l,M=0,R=mid;
			while (L<=R) {
				if (L==R) {
					b[a[i]]=a[L];
					break;
				}
				M=(L+R)/2;
				ask(L,M,i);
				scanf("%d",&ans);
				tot=count(L,M);
				if (ans==tot+1) {
					L=M+1;
				} else {
					R=M;
				}
			}
		}
	}
	REP(i,mid+1,r) a[i]=b[a[i]];
}
int main() {
 
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    scanf("%d",&n);
    solve(1,n);
    printf("%d ",0);
    FOR(i,n) printf("%d ",a[i]);
    fflush(stdout);
	return 0;
}

Compilation message

carnival.cpp: In function 'void solve(int, int)':
carnival.cpp:55:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&ans);
   ~~~~~^~~~~~~~~~~
carnival.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&ans);
     ~~~~~^~~~~~~~~~~
carnival.cpp: In function 'int main()':
carnival.cpp:90:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 248 KB Output is correct
2 Correct 10 ms 328 KB Output is correct
3 Correct 11 ms 400 KB Output is correct
4 Correct 7 ms 444 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 8 ms 496 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 512 KB Output is correct
2 Correct 9 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 8 ms 684 KB Output is correct
5 Correct 6 ms 688 KB Output is correct
6 Correct 5 ms 688 KB Output is correct
7 Correct 10 ms 688 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 688 KB Output is correct
2 Correct 11 ms 688 KB Output is correct
3 Correct 9 ms 688 KB Output is correct
4 Correct 7 ms 688 KB Output is correct
5 Correct 5 ms 688 KB Output is correct
6 Correct 5 ms 688 KB Output is correct
7 Correct 10 ms 688 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 688 KB Output is correct
2 Correct 8 ms 688 KB Output is correct
3 Correct 11 ms 688 KB Output is correct
4 Correct 8 ms 688 KB Output is correct
5 Correct 9 ms 688 KB Output is correct
6 Correct 7 ms 688 KB Output is correct
7 Correct 10 ms 688 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 688 KB Output is correct
2 Correct 6 ms 688 KB Output is correct
3 Correct 10 ms 688 KB Output is correct
4 Correct 10 ms 688 KB Output is correct
5 Correct 7 ms 688 KB Output is correct
6 Correct 9 ms 688 KB Output is correct
7 Correct 6 ms 688 KB Output is correct