oj.uz

Submission #884440

# Submission time Handle Problem Language Result Execution time Memory
884440 2023-12-07T11:12:38 Z lalig777 Turnir (COCI17_turnir) C++14
0 / 100
 409 ms 18648 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

int main(){
	int n;
	cin>>n;
	int ntotal=1;
	for (int i=0; i<n; i++) ntotal*=2;
	vector<pair<int,int> >nums(ntotal);
    vector<int>nivel(ntotal);
	for (int i=0; i<ntotal; i++){
		cin>>nums[i].first;
		nums[i].second=i;
	}sort(nums.begin(), nums.end());
	int xact=1, xant=0;
	for (int i=0; i<n; i++){
		for (int j=xant; j<min(xact, ntotal); j++) nivel[nums[j].second]=i;
		xant=xact;
        xact=(xact+1)*2-1;
	}for (int i=ntotal-2; i>=0; i--){
		if (nums[i].first==nums[i+1].first) nivel[nums[i].second]=nivel[nums[i+1].second];
	}for (int i=0; i<ntotal; i++) cout<<n-nivel[i]<<" ";
	cout<<endl;
    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Incorrect 2 ms 348 KB Output isn't correct
5 Incorrect 11 ms 948 KB Output isn't correct
6 Incorrect 27 ms 1624 KB Output isn't correct
7 Incorrect 44 ms 2736 KB Output isn't correct
8 Incorrect 87 ms 4788 KB Output isn't correct
9 Incorrect 192 ms 9696 KB Output isn't correct
10 Incorrect 409 ms 18648 KB Output isn't correct