oj.uz

Submission #149208

# Submission time Handle Problem Language Result Execution time Memory
149208 2019-09-01T05:58:25 Z 본인 방금 올솔하는 상상함(#3610, gs18113, dennisstar, red1108) King of Chairs (FXCUP4_chairs) C++17
95 / 100
 174 ms 10460 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 bef;
		}
		bef = W[i];
	}
	return 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 = B;
}

int Maid(int W){
	if(W<=Wmax){
		auto it = se.lower_bound(make_pair(W,0));
		int ret = it->second;
		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

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1056 KB Correct
2 Correct 10 ms 800 KB Correct
3 Correct 10 ms 1056 KB Correct
4 Correct 11 ms 1056 KB Correct
5 Correct 10 ms 1048 KB Correct

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 5952 KB Correct
2 Correct 117 ms 9636 KB Correct
3 Correct 121 ms 10316 KB Correct
4 Correct 130 ms 10192 KB Correct
5 Correct 137 ms 10448 KB Correct
6 Correct 134 ms 10196 KB Correct
7 Correct 120 ms 10448 KB Correct

Subtask #3
40.0 / 45.0

# Verdict Execution time Memory Grader output
1 Partially correct 88 ms 5904 KB B = 993847
2 Partially correct 146 ms 9648 KB B = 996200
3 Partially correct 146 ms 10444 KB B = 706116
4 Partially correct 171 ms 10440 KB B = 998466
5 Partially correct 168 ms 10460 KB B = 995867
6 Partially correct 174 ms 9940 KB B = 997501
7 Partially correct 166 ms 10364 KB B = 706123
8 Correct 131 ms 10312 KB Correct