oj.uz

답안 #149799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149799 2019-09-01T07:11:12 Z (παρα)γεμιστά(#3619, cfalas, ctziapo, Charis02) King of Chairs (FXCUP4_chairs) C++17
0 / 100
 74 ms 6704 KB 
#include "king.h"
#include<map>
#include<vector>
#include<algorithm>
#include<iostream>
#define ll long long
#define rep(i,a,b) for(int i = a;i < b;i++)
#define MAXN 300003

long long SendInfo(std::vector<int> W, std::vector<int> C) {
	int n = W.size();
    int cur = 0;
    int first= 0;

    sort(W.rbegin(),W.rend());
    sort(C.rbegin(),C.rend());

	rep(i,0,n)
	{
        if(W[i] <= C[cur])
        {
            first = W[i];
            cur++;
        }
	}

	if(cur==0)
        return 0;

	return W[n-cur];
}

#include "vassal.h"
#include<map>
#include<vector>
#include<iostream>
#include<set>
#define ll long long
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define rep(i,a,b) for(int i = a;i < b;i++)
#define MAXN 1000003

using namespace std;

long long maxi;
ll seg[4*MAXN];
set < pi > available;
/*
void update(ll low,ll high,ll pos,ll slow)
{
    if(low == high && low == slow)
    {
        seg[pos]++;
        return;
    }
    if(low > slow || high < slow)
        return;

    ll mid = (low+high)/2;
    update(low,mid,pos*2+1,slow);
    update(mid+1,high,pos*2+2,slow);

    return;
}

ll query(ll low,ll high,ll pos,ll slow)
{
    if(low >= slow)
    {

    }
    if(high < slow)
        return 0;

    ll mid = (low+high)/2;
}
*/
void Init(long long B, std::vector<int> C){
	int n = C.size();
	maxi = B;

	rep(i,0,n)
	{
        available.insert(mp(C[i],i));
	}

	return;
}

int Maid(int W){
    if(W>maxi)
        return -1;
    else
    {
        set < pi >::iterator it = available.lower_bound(mp(W,0));
        return (*it).second;
    }
}

Compilation message

king.cpp: In function 'long long int SendInfo(std::vector<int>, std::vector<int>)':
king.cpp:13:9: warning: variable 'first' set but not used [-Wunused-but-set-variable]
     int first= 0;
         ^~~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1144 KB Correct
2 Runtime error 11 ms 1044 KB Execution failed because the return code was nonzero
3 Halted 0 ms 0 KB -

Subtask #2
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 67 ms 6704 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 74 ms 6704 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -