#include <bits/stdc++.h>
using namespace std;
enum class Events {Color, Sheet};
struct Container {
int x_low, x_high;
int y_low, y_high;
set<int>* colors;
vector<Container> children;
Container(int xl, int xh, int yl, int yh):
x_low(xl), x_high(xh), y_low(yl), y_high(yh) {
colors = new set<int>();
}
};
struct Event {
Events type;
int x_pos;
int y_low, y_high;
bool close;
Event(Events t, int x, int yl, int yh, bool c):
type(t), x_pos(x), y_low(yl), y_high(yh), close(c) {}
};
vector<vector<Container*>> test(80000, vector<Container*>(80000, new Container(0, 0, 0, 0)));
int main(){
// cin.tie(NULL)->sync_with_stdio(false);
// int n, m;
// cin >> n >> m;
// vector<Event> actions;
// for(int i = 0; i < n; i++){
// int lx, ly, ux, uy;
// cin >> lx >> ly >> ux >> uy;
// actions.emplace_back(Events::Sheet, lx, ly, uy, false);
// actions.emplace_back(Events::Sheet, lx, ly, uy, true);
// }
// for(int i = 0; i < m; i++){
// int x, y, c;
// cin >> x >> y >> c;
// actions.emplace_back(Events::Color, x, y, y, true);
// }
// auto actionComp = [](const auto &a, const auto &b){
// if(a.x_pos == b.x_pos)
// return a.y_low < b.y_low;
// return a.x_pos < b.x_pos;
// };
// sort(actions.begin(), actions.end(), actionComp);
// Container root(0, 0, 1e9+1, -1);
// for(const Event event : actions){
// if(event.type == Events::Sheet){
// }else{
// }
// }
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
215 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
218 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
191 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
193 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
199 ms |
524288 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |