oj.uz

Submission #151632

# Submission time Handle Problem Language Result Execution time Memory
151632 2019-09-04T00:18:39 Z shdut Crosses on the Grid (FXCUP4_cross) C++17
0 / 100
 2 ms 252 KB 
#include "cross.h"
#include <iostream>
#include <stdio.h>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <algorithm>
#include <assert.h>

using namespace std;

#define rep(i, a, b) for(int i = a; i < b; i++)
#define per(i, a, b) for(int i = b - 1; i >= a; i--)
#define ll long long
#define x first
#define y second
#define vi vector<int>
#define pii pair<int, int>
#define SZ(x) (int)(x.size())
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define inf 1000000007
#define DBG(x) cerr << (#x) << "=" << x << "\n";

#define N 100005

template<typename U, typename V> void Min(U &a, const V &b){if(a > b) a = b;}
template<typename U, typename V> void Max(U &a, const V &b){if(a < b) a = b;}
template<typename U, typename V> void add(U &a, const V &b){a = (a+b) % mod;}



long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
	int n = I.size();
	vector<pii> a(n);
	rep(i, 0, n)a[i] = {I[i], O[i]};
	sort(all(a));
	ll ans = 0;
	multiset<int>s;
	per(i, 0, n){
		if(s.size() == K - 1){
			int x = min(*s.begin(), a[i].y);
			Max(ans, 1LL * a[i].x * a[i].x + 2LL * a[i].x * (x - a[i].x));
		}
		s.insert(a[i].y);
		if(s.size() >= K)s.erase(s.begin());
	}
	return ans;
}

Compilation message

cross.cpp: In function 'long long int SelectCross(int, std::vector<int>, std::vector<int>)':
cross.cpp:46:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(s.size() == K - 1){
      ~~~~~~~~~^~~~~~~~
cross.cpp:51:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(s.size() >= K)s.erase(s.begin());
      ~~~~~~~~~^~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 252 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 252 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 252 KB Output isn't correct
2 Halted 0 ms 0 KB -