# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
101487 | 2019-03-19T03:11:15 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]; vector<ii> co(n); for (int i = 0; i < n; i++){ scanf("%d%d",&co[i].first,&co[i].second); for (int j = 0; j < i; j++){ if ((co[i].first < co[j].first && co[i].second < co[j].second) || (co[i].first > co[j].first && co[i].second > co[j].second)){ adjlist[i].push_back(j); adjlist[j].push_back(i); } } } int ans = 0; int dist[n]; for (int i = 0; i < n; i++){ ans = 0; memset(dist,-1,sizeof(dist)); queue<int> q; dist[i] = 0; q.push(i); while (q.size()){ int u = q.front(); q.pop(); for (auto v : adjlist[u]){ if (dist[v] == -1){ dist[v] = dist[u]+1; ans += dist[v]; q.push(v); } } } printf("%d\n",ans); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 3 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 | 3 ms | 252 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 299 ms | 1224 KB | Output is correct |
2 | Execution timed out | 2005 ms | 7012 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2033 ms | 4956 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2067 ms | 197460 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1354 ms | 263168 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |