# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1060868 | vjudge1 | Job Scheduling (IOI19_job) | C++17 | 0 ms | 0 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 "cards.h"
#include<bits/stdc++.h>
using namespace std;
int midpt,K,N;
map<tuple<int,int,int>,int> mp1;
map<pair<int,int>,int>mp2;
int fac(int n){
if(!n)return 1;
return n*fac(n-1);
}
int getbak(vector<int>ord){
vector<int>huhhh;
int n=ord.size();
for(int i=0;i<n;i++)
huhhh.push_back(find(ord.begin(),ord.end(),i)-ord.begin()),
ord.erase(find(ord.begin(),ord.end(),i));
int ans=0;
for(int i=n;i--;){
ans+=huhhh[n-i-1]*fac(i);
}
return ans;
}
vector<int>reorder(int val,vector<int>things){
val--;
int n=things.size();
vector<int> huhhh;
for(int i=n;i--;) {
huhhh.push_back(val/fac(i));
val%=fac(i);
}