| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 150649 | 갓띵건 (#200) | Wine Tasting (FXCUP4_wine) | C++17 | 10 ms | 1028 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bartender.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> BlendWines(int k, vector<int> r){
	int n = r.size(),p=k;
	if(k<9){
		for(int i=0;i<n;i++){
			r[i]=1;
		}
		return r;
	}
	if(k>9) p=10;
	vector<int> v;
	for(int i=0;i<n;i++){
		r[i]=r[i]%p+1;
	}
	return r;
}
#include "taster.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> SortWines(int k, vector<int> a) {
	int n = a.size(),p=9;
	if(k>9) p=10; 
	vector<int> v[31],ans;
	ans.resize(n);
	for(int i=0;i<n;i++){
		v[a[i]].push_back(i);
	}
	for(int i=1;i<=p;i++){
		for(int t=0;t<v[i].size();t++){
			for(int j=0;j<t;j++){
				if(Compare(v[i][j],v[i][t])>0) swap(v[i][t],v[i][j]);
			}
		}
		for(int t=0;t<v[i].size();t++) ans[v[i][t]]=i+p*t;
	}
	for(int i=0;i<n;i++){
		if(ans[i]%p==1) ans[i]=ans[i]+p-1;
		else ans[i]=ans[i]-1;
	}
	return ans;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
