oj.uz

답안 #998405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998405 2024-06-14T00:07:15 Z efishel Super Dango Maker (JOI22_dango3) C++17
7 / 100
 537 ms 604 KB 
//Código de dango3 Saul
#include "dango3.h"
#include <vector>
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define pb push_back

using namespace std;

void Solve(int N, int M) {
	vector<int> C[N], ans, pos, aux;
	rep(i,0,N*M) pos.pb(i+1);
	rep(i,0,N){
		rep(j,0,M){
			int l=0, r=pos.size(), mid;
			while(l<=r){
				mid=(l+r)>>1;
				aux.clear();
				rep(i,0,mid+1) aux.pb(pos[i]);
				rep(k,0,i) aux.pb(C[k].back());
				if(Query(aux)) r=mid-1;
				else l=mid+1;
			}
			C[i].pb(pos[l]);
			pos.erase(pos.begin()+l);
		}
	}
	rep(i,0,M){
		ans.clear();
		rep(j,0,N) ans.pb({C[j][i]});
		Answer(ans);
	}
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 198 ms 584 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 537 ms 604 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -