# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4801 | cki86201 | Schools (IZhO13_school) | C++98 | 236 ms | 11512 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<functional>
using namespace std;
#define X first
#define Y second
typedef long long ll;
typedef pair<int,int> Pi;
int N,M,S;
bool chk[300030][2];
bool chk1[300030],chk2[300030];
ll ans;
struct data{
int x,y,c;
bool operator<(const data &l)const{
return c<l.c;
}
}inp[300030];
priority_queue <Pi, vector<Pi>, greater<Pi> >pq1;
priority_queue <Pi> pq2;
priority_queue <int> pq3;
bool compx(const data &a,const data &b){return a.x<b.x;}
bool compy(const data &a,const data &b){return a.y<b.y;}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |