oj.uz

Submission #151250

# Submission time Handle Problem Language Result Execution time Memory
151250 2019-09-02T10:25:53 Z dongwon0427 Crosses on the Grid (FXCUP4_cross) C++17
0 / 100
 2 ms 376 KB 
#include "cross.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
long long SelectCross(int k, std::vector<int> I, std::vector<int> O) {
	int n = I.size();
	vector<pii> v;
	for(int i=0;i<n;i++) {
        v.push_back(pii(I[i], O[i]));
	}
	sort(v.begin(), v.end());

	vector<pii> w;
	for(int i=0;i<n;i++) {
        while(!w.empty() && w.back().second <= v[i].second) w.pop_back();
        w.push_back(v[i]);
	}

	n = w.size();
	k = min(k, n);
	ll ret = 0;
    for(int i=0;i+k-1<n;i++) {
        ret = max(ret, (ll)w[i].first * w[i+k-1].second);
    }
	return ret;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 55.0

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

Subtask #3
0 / 37.0

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