Submission #87780

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
87780	2018-12-02 13:43:51	KCSC	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	625 ms	123452 KiB

skyscraper

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int DIM = 30005;
int ans[DIM]; 
pair<int, int> arr[DIM];
vector<int> lst[DIM];
bitset<DIM> oki[DIM], vis;
struct str {
  int ps, pw, tm; };
deque<str> que;
int main(void) {
#ifdef HOME
  freopen("skyscraper.in", "r", stdin); 
  freopen("skyscraper.out", "w", stdout);
#endif
  int n, m; cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    cin >> arr[i].first >> arr[i].second;
    lst[arr[i].first].push_back(i); ans[i] = 1000000000; }
  que.push_back({arr[0].first, arr[0].second, 0}); 
  ans[0] = 0; oki[arr[0].first][arr[0].second] = true;
  while (que.size()) {
    int ps = que.front().ps, pw = que.front().pw, tm = que.front().tm; 
    que.pop_front();
    if (!vis[ps]) {
      vis[ps] = true;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 14 / 14
• Subtask 4: 21 / 21
• Subtask 5: 43 / 43