# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
101521 | 2019-03-19T03:35:35 Z | dantoh000 | 섬 항해 (CEOI13_adriatic) | C++14 | 2000 ms | 263168 KB |
#include <bits/stdc++.h> using namespace std; typedef pair<int,int> ii; int main(){ int n; scanf("%d",&n); vector<int> adjlist[n]; int x[n], y[n]; for (int i = 0; i < n; i++){ scanf("%d%d",&x[i],&y[i]); for (int j = 0; j < i; j++){ if ((x[i]<x[j]&&y[i]<y[j]) || (x[i]>x[j]&&y[i]>y[j])){ //printf("%d %d con\n",i,j); adjlist[i].push_back(j); adjlist[j].push_back(i); } } } int ans = 0; int adjmat[n][n]; memset(adjmat,-1,sizeof(adjmat)); for (int i = 0; i < n; i++){ queue<int> q; adjmat[i][i] = 0; q.push(i); while (q.size()){ int u = q.front(); q.pop(); for (auto v : adjlist[u]){ if (adjmat[i][v] != -1) continue; adjmat[i][v] = adjmat[i][u]+1; q.push(v); } } } for (int i = 0; i < n; i++){ int sum = 0; for (int j = 0; j < n; j++){ sum += adjmat[i][j]; //printf("%d ",adjmat[i][j]); } printf("%d\n",sum); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
3 | Correct | 3 ms | 384 KB | Output is correct |
4 | Correct | 3 ms | 384 KB | Output is correct |
5 | Correct | 2 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 330 ms | 9888 KB | Output is correct |
2 | Execution timed out | 2024 ms | 15608 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2066 ms | 102648 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2081 ms | 203752 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1321 ms | 263168 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |