oj.uz

답안 #149260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149260 2019-09-01T06:04:58 Z 본인 방금 올솔하는 상상함(#3610, gs18113, dennisstar, red1108) King of Chairs (FXCUP4_chairs) C++17
95 / 100
 188 ms 10456 KB 
#include "king.h"
#include<algorithm>
using namespace std;
long long SendInfo(vector<int> W, vector<int> C) {
	int N = W.size();
	sort(W.begin(), W.end());
	sort(C.begin(), C.end());
	int j=0,cnt=0,bef=0;
	long long ret=0;


	for(int i=0;i<N;i++,j++){
		while(j<C.size()&&W[i]>C[j]) j++;
		if(j>=C.size()){
			return (1000000-bef);
		}
		bef = W[i];
	}
	return (1000000-W[N-1]);
}
#include "vassal.h"
#include <bits/stdc++.h>
using namespace std;
long long Wmax;
set<pair<int,int>> se;
int cnt;
void Init(long long B, vector<int> C){
	for(int i=0;i<C.size();i++){
		se.insert(make_pair(C[i],i));
	}
	Wmax = 1000000-B;
}

int Maid(int W){
	if(W<=Wmax){
		auto it = se.lower_bound(make_pair(W,0));
		int ret = it->second;
		if(it==se.end()) return -1;
		if((it->first)<W) return -1;
		se.erase(it);
		cnt++;
		return ret;
	}
	return -1;
}

Compilation message

king.cpp: In function 'long long int SendInfo(std::vector<int>, std::vector<int>)':
king.cpp:13:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(j<C.size()&&W[i]>C[j]) j++;
         ~^~~~~~~~~
king.cpp:14:7: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(j>=C.size()){
      ~^~~~~~~~~~
king.cpp:8:10: warning: unused variable 'cnt' [-Wunused-variable]
  int j=0,cnt=0,bef=0;
          ^~~
king.cpp:9:12: warning: unused variable 'ret' [-Wunused-variable]
  long long ret=0;
            ^~~

vassal.cpp: In function 'void Init(long long int, std::vector<int>)':
vassal.cpp:8:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<C.size();i++){
              ~^~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1056 KB Correct
2 Correct 10 ms 1056 KB Correct
3 Correct 11 ms 548 KB Correct
4 Correct 11 ms 1060 KB Correct
5 Correct 11 ms 1052 KB Correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 5944 KB Correct
2 Correct 114 ms 9644 KB Correct
3 Correct 124 ms 10452 KB Correct
4 Correct 125 ms 10188 KB Correct
5 Correct 127 ms 10184 KB Correct
6 Correct 130 ms 10188 KB Correct
7 Correct 131 ms 10456 KB Correct

Subtask #3
40.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 88 ms 5940 KB B = 6153
2 Partially correct 169 ms 9648 KB B = 3800
3 Partially correct 159 ms 10444 KB B = 293884
4 Partially correct 176 ms 10448 KB B = 1534
5 Partially correct 188 ms 10444 KB B = 4133
6 Partially correct 164 ms 10244 KB B = 2499
7 Partially correct 151 ms 10192 KB B = 293877
8 Partially correct 128 ms 10448 KB B = 1000000