# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
204462 | 14kg | 문명 (KOI17_civilization) | C++11 | 1004 ms | 39992 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 <queue>
#include <vector>
#include <functional>
#include <algorithm>
#define max2(x,y) (x>y?x:y)
using namespace std;
typedef pair<int,pair<int,int> > pip;
int n, m, p[100001], max_t;
int dy[4]={1,-1,0,0}, dx[4]={0,0,1,-1};
pair<int,int> board[2001][2001];
queue<int> Q;
priority_queue<pip,vector<pip>,greater<pip> > Q2;
int get_p(int x){
if(p[x]==x) return x;
return p[x]=get_p(p[x]);
}
int main(){
int x, y, xx, yy, tx, ty;
scanf("%d %d",&n,&m);
for(int i=1; i<=m; i++){
scanf("%d %d",&x,&y);
board[x][y]={i,0}, p[i]=i;
Q.push(x), Q.push(y);
}
while(!Q.empty()){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |