oj.uz

Submission #151723

# Submission time Handle Problem Language Result Execution time Memory
151723 2019-09-04T11:15:14 Z leduykhongngu Crosses on the Grid (FXCUP4_cross) C++17
8 / 100
 306 ms 14440 KB 
#include <vector>
#include <set>
#include <algorithm>
#include <assert.h>
long long SelectCross(int K, std::vector<int> I, std::vector<int> O) {
    //i<o
    int n = I.size();
    std::vector< std::pair<int, int > > rectangles;
    for (int i = 0; i < n; ++i)  {
        rectangles.push_back({O[i], -I[i]});
    }
    sort(rectangles.begin(), rectangles.end());
    //reverse(rectangles.begin(), rectangles.end());
    std::multiset< int > myset;
    for (auto &rec : rectangles) {
        myset.insert(rec.second = -rec.second);
    }
    int cnt = 0;
    long long res = 0;
    int last = 0;
    for (auto rec : rectangles) {
        //delete rec
        int Long = rec.first, Short = (K == 1? rec.second : *myset.begin());
        assert(Long >= Short);
        res = std::max(res, 1ll * Long * Long - 1ll * (Long - Short) * (Long - Short));
        myset.erase(myset.find(rec.second));
        if (myset.size() < K) break;
    }
    return res;
}

Compilation message

cross.cpp: In function 'long long int SelectCross(int, std::vector<int>, std::vector<int>)':
cross.cpp:27:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (myset.size() < K) break;
             ~~~~~~~~~~~~~^~~
cross.cpp:18:9: warning: unused variable 'cnt' [-Wunused-variable]
     int cnt = 0;
         ^~~
cross.cpp:20:9: warning: unused variable 'last' [-Wunused-variable]
     int last = 0;
         ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 13 ms 1144 KB Output is correct
6 Correct 303 ms 14428 KB Output is correct
7 Correct 294 ms 14440 KB Output is correct
8 Correct 306 ms 14360 KB Output is correct

Subtask #2
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 13 ms 1144 KB Output is correct
6 Correct 303 ms 14428 KB Output is correct
7 Correct 294 ms 14440 KB Output is correct
8 Correct 306 ms 14360 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Incorrect 2 ms 252 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 13 ms 1144 KB Output is correct
6 Correct 303 ms 14428 KB Output is correct
7 Correct 294 ms 14440 KB Output is correct
8 Correct 306 ms 14360 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Incorrect 2 ms 252 KB Output isn't correct
11 Halted 0 ms 0 KB -