Submission #832369

#	Time	Username	Problem	Language	Result	Execution time	Memory
832369		Liudas	Crosses on the Grid (FXCUP4_cross)	C++17	0 / 100	0 ms	212 KiB

cross

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
struct cross{
    int i, o;
    long long s;
};
int SelectCross(int K, vector<int> I, vector<int> O){
    int N = I.size();
    vector<cross> arr(N);
    for(int i = 0; i < N;  i++){
        arr[i] = {I[i], O[i], 1ll * I[i] * O[i] * 2 - 1ll * I[i] * I[i]};
    }
    sort(arr.begin(), arr.end(), [](cross a, cross b){return a.s < b.s;});
    return arr.back().s;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 55
• Subtask 3: 0 / 37