oj.uz

Submission #150571

# Submission time Handle Problem Language Result Execution time Memory
150571 2019-09-01T08:39:39 Z 준표야 함수컵은 캐리해줄거지?(#3588, Acka, spectaclehong, heiler) King of Chairs (FXCUP4_chairs) C++17
0 / 100
 65 ms 4848 KB 
#include "king.h"
#include <algorithm>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

long long SendInfo(std::vector<int> W, std::vector<int> C) {
	int N = W.size();

	vector<pii> ws, cs;
	for(int i=0;i<N;i++) {
	  cs.push_back({C[i], i});
	}
	sort(cs.begin(), cs.end());

	for(int i=0;i<N;i++) {
	  ws.push_back({W[i], i});
	}
	sort(ws.begin(), ws.end());

	int *ans = new int[N];

	int wi=0;
	int ci=0;
	for(;wi<N && ci<N;) {
	  while(ci<N && ws[wi].first>cs[ci].first) {
	     ci++;
	  }
	  if(ci==N) break;
	  
	  ans[ws[wi].second] = cs[ci].second;
	  wi++; ci++;
	}
	for(int i=wi;i<N;i++)
	  ans[ws[i].second] = -1;
	
	ll ret = 0;
	for(int i = 0; i < N; i++)
		ret = ret * 11 + (ans[i] + 1);
	return ret;	
	// return ((unsigned long long)ans % (1ll << 32));
}
#include "vassal.h"
using namespace std;

int last, ans[100000];

void Init(long long B, std::vector<int> C){
	int N = C.size();
	for(int i = N - 1; i >= 0; i--){
		ans[i] = B % 11;
		B = (B - ans[i]) / 11;
		ans[i]--;
	}
}

int Maid(int W){
	return ans[last];
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1056 KB Correct
2 Runtime error 10 ms 1052 KB Execution failed because the return code was nonzero
3 Halted 0 ms 0 KB -

Subtask #2
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 4848 KB Wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 4848 KB Wrong
2 Halted 0 ms 0 KB -