oj.uz

Submission #182381

# Submission time Handle Problem Language Result Execution time Memory
182381 2020-01-09T13:28:21 Z arman_ferdous Robots (IOI13_robots) C++17
0 / 100
 15 ms 468 KB 
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;

struct ds{
	multiset<pair<int,int>> st;
	void insert(int x, int y) {
		st.insert({x, y});
	}
	void remove(int x, int y) {
		st.erase({x, y});
	}
	pair<int,int> find(int x) {
		auto it = st.lower_bound({x, -1});
		if(it == st.begin()) return {-1, -1};
		it--; return {it->first, it->second};
	}
}one, two;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
	sort(X, X + A);
	sort(Y, Y + B);
    for(int i = 0; i < T; i++) {
    	one.insert(W[i], S[i]);
    	two.insert(S[i], W[i]);
    }
    int ans = 0, sz = T;
    while(sz) {
    	int cnt = 0;
    	for(int i = A - 1; i >= 0 && sz; i--) {
    		auto got = one.find(X[i]);
    		if(got.first == -1) break;
    		cnt++, sz--;
    		one.remove(got.first, got.second);
    		two.remove(got.second, got.first);
    	}
    	for(int i = 0; i < B && sz; i++) {
    		auto got = two.find(Y[i]);
    		if(got.first == -1) break;
    		cnt++, sz--;
    		two.remove(got.first, got.second);
    		one.remove(got.second, got.first);
    	}
    	if(cnt == 0) { ans = -1; break; }
    	ans++;
    }
    return ans;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 15 ms 352 KB Output is correct
4 Incorrect 2 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 404 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 276 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -