답안 #35693 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
35693	2017-11-28T06:39:09 Z	funcsr	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	103 ms	94592 KB

skyscraper

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
typedef pair<int, P> P2;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
const int B = 200;
const int LIM = 100000;

int N, M;
vector<int> G[30000];
int D[30000][B+1];
queue<P> Q[LIM];

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> M;
  rep(i, N) rep(j, B+1) D[i][j] = INF;
  int sx = 0, tx = 0;
  rep(i, M) {
    int b, p;
    cin >> b >> p;
    if      (i == 0) sx = b;
    else if (i == 1) tx = b;
    G[b].pb(p);
  }
  rep(i, N) sort(all(G[i])), uniq(G[i]);

  D[sx][0] = 0;
  Q[0].push(P(sx, 0));

  rep(r, LIM) {
    while (!Q[r].empty()) {
      int x = Q[r].front()._1, p = Q[r].front()._2;
      Q[r].pop();
      if (D[x][p] < r) continue;

      if (p == 0) {
        for (int np : G[x]) {
          if (np <= B) {
            if (D[x][np] > r) {
              D[x][np] = r;
              Q[r].push(P(x, np));
            }
          }
          else {
            for (int t=x%np; t<N; t+=np) {
              int cost = abs(x-t)/np;
              if (D[t][0] > r+cost) {
                D[t][0] = r+cost;
                Q[r+cost].push(P(t, 0));
              }
            }
          }
        }
      }
      else {
        if (D[x][0] > r) {
          D[x][0] = r;
          Q[r].push(P(x, 0));
        }
        if (x-p >= 0) {
          if (D[x-p][p] > r+1) {
            D[x-p][p] = r+1;
            Q[r+1].push(P(x-p, p));
          }
        }
        if (x+p < N) {
          if (D[x+p][p] > r+1) {
            D[x+p][p] = r+1;
            Q[r+1].push(P(x+p, p));
          }
        }
      }
    }
  }
  int m = D[tx][0];
  if (m == INF) m = -1;
  cout << m << "\n";
  return 0;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	49 ms	93536 KB	Output is correct
2	Correct	33 ms	93536 KB	Output is correct
3	Correct	43 ms	93536 KB	Output is correct
4	Correct	53 ms	93536 KB	Output is correct
5	Correct	49 ms	93536 KB	Output is correct
6	Correct	56 ms	93536 KB	Output is correct
7	Correct	49 ms	93536 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	43 ms	93536 KB	Output is correct
2	Correct	39 ms	93536 KB	Output is correct
3	Correct	56 ms	93536 KB	Output is correct
4	Correct	46 ms	93536 KB	Output is correct
5	Correct	59 ms	93536 KB	Output is correct
6	Correct	43 ms	93536 KB	Output is correct
7	Correct	49 ms	93536 KB	Output is correct
8	Correct	53 ms	93536 KB	Output is correct
9	Correct	36 ms	93536 KB	Output is correct
10	Correct	46 ms	93536 KB	Output is correct
11	Correct	36 ms	93668 KB	Output is correct
12	Correct	43 ms	93672 KB	Output is correct
13	Correct	69 ms	93672 KB	Output is correct
14	Correct	56 ms	93668 KB	Output is correct
15	Correct	56 ms	93668 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	36 ms	93536 KB	Output is correct
2	Correct	46 ms	93536 KB	Output is correct
3	Correct	39 ms	93536 KB	Output is correct
4	Correct	46 ms	93536 KB	Output is correct
5	Correct	29 ms	93536 KB	Output is correct
6	Correct	39 ms	93536 KB	Output is correct
7	Correct	33 ms	93536 KB	Output is correct
8	Correct	49 ms	93536 KB	Output is correct
9	Correct	46 ms	93536 KB	Output is correct
10	Correct	39 ms	93536 KB	Output is correct
11	Correct	39 ms	93668 KB	Output is correct
12	Correct	39 ms	93672 KB	Output is correct
13	Correct	49 ms	93672 KB	Output is correct
14	Correct	59 ms	93668 KB	Output is correct
15	Correct	63 ms	93668 KB	Output is correct
16	Correct	46 ms	93536 KB	Output is correct
17	Correct	53 ms	93668 KB	Output is correct
18	Correct	66 ms	93668 KB	Output is correct
19	Correct	29 ms	93668 KB	Output is correct
20	Correct	59 ms	93668 KB	Output is correct
21	Correct	56 ms	93668 KB	Output is correct
22	Correct	49 ms	93668 KB	Output is correct
23	Correct	53 ms	93668 KB	Output is correct
24	Correct	49 ms	93668 KB	Output is correct
25	Correct	63 ms	93668 KB	Output is correct
26	Correct	56 ms	93672 KB	Output is correct
27	Correct	59 ms	93672 KB	Output is correct
28	Correct	69 ms	93668 KB	Output is correct
29	Correct	46 ms	93668 KB	Output is correct
30	Correct	23 ms	93536 KB	Output is correct
31	Correct	63 ms	93668 KB	Output is correct
32	Correct	39 ms	93668 KB	Output is correct
33	Correct	63 ms	93668 KB	Output is correct
34	Correct	46 ms	93668 KB	Output is correct

Subtask #4
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	39 ms	93536 KB	Output is correct
2	Correct	49 ms	93536 KB	Output is correct
3	Correct	56 ms	93536 KB	Output is correct
4	Correct	49 ms	93536 KB	Output is correct
5	Correct	59 ms	93536 KB	Output is correct
6	Correct	36 ms	93536 KB	Output is correct
7	Correct	56 ms	93536 KB	Output is correct
8	Correct	36 ms	93536 KB	Output is correct
9	Correct	43 ms	93536 KB	Output is correct
10	Correct	63 ms	93536 KB	Output is correct
11	Correct	46 ms	93668 KB	Output is correct
12	Correct	43 ms	93672 KB	Output is correct
13	Correct	53 ms	93672 KB	Output is correct
14	Correct	59 ms	93668 KB	Output is correct
15	Correct	76 ms	93668 KB	Output is correct
16	Correct	43 ms	93536 KB	Output is correct
17	Correct	46 ms	93668 KB	Output is correct
18	Correct	46 ms	93668 KB	Output is correct
19	Correct	43 ms	93668 KB	Output is correct
20	Correct	43 ms	93668 KB	Output is correct
21	Correct	33 ms	93668 KB	Output is correct
22	Correct	43 ms	93668 KB	Output is correct
23	Correct	46 ms	93668 KB	Output is correct
24	Correct	76 ms	93668 KB	Output is correct
25	Correct	56 ms	93668 KB	Output is correct
26	Correct	46 ms	93672 KB	Output is correct
27	Correct	53 ms	93672 KB	Output is correct
28	Correct	63 ms	93668 KB	Output is correct
29	Correct	43 ms	93668 KB	Output is correct
30	Correct	56 ms	93536 KB	Output is correct
31	Correct	59 ms	93668 KB	Output is correct
32	Correct	66 ms	93668 KB	Output is correct
33	Correct	43 ms	93668 KB	Output is correct
34	Correct	49 ms	93668 KB	Output is correct
35	Correct	46 ms	93800 KB	Output is correct
36	Correct	49 ms	93668 KB	Output is correct
37	Correct	63 ms	93800 KB	Output is correct
38	Correct	73 ms	93932 KB	Output is correct
39	Correct	66 ms	93932 KB	Output is correct
40	Correct	83 ms	93932 KB	Output is correct
41	Correct	49 ms	93932 KB	Output is correct
42	Correct	56 ms	93804 KB	Output is correct
43	Correct	69 ms	93804 KB	Output is correct
44	Correct	46 ms	93804 KB	Output is correct
45	Correct	99 ms	93932 KB	Output is correct
46	Correct	89 ms	93932 KB	Output is correct

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	26 ms	93536 KB	Output is correct
2	Correct	43 ms	93536 KB	Output is correct
3	Correct	43 ms	93536 KB	Output is correct
4	Correct	53 ms	93536 KB	Output is correct
5	Correct	53 ms	93536 KB	Output is correct
6	Correct	29 ms	93536 KB	Output is correct
7	Correct	43 ms	93536 KB	Output is correct
8	Correct	43 ms	93536 KB	Output is correct
9	Correct	53 ms	93536 KB	Output is correct
10	Correct	43 ms	93536 KB	Output is correct
11	Correct	56 ms	93668 KB	Output is correct
12	Correct	59 ms	93672 KB	Output is correct
13	Correct	56 ms	93672 KB	Output is correct
14	Correct	69 ms	93668 KB	Output is correct
15	Correct	73 ms	93668 KB	Output is correct
16	Correct	49 ms	93536 KB	Output is correct
17	Correct	53 ms	93668 KB	Output is correct
18	Correct	33 ms	93668 KB	Output is correct
19	Correct	49 ms	93668 KB	Output is correct
20	Correct	39 ms	93668 KB	Output is correct
21	Correct	46 ms	93668 KB	Output is correct
22	Correct	36 ms	93668 KB	Output is correct
23	Correct	43 ms	93668 KB	Output is correct
24	Correct	49 ms	93668 KB	Output is correct
25	Correct	53 ms	93668 KB	Output is correct
26	Correct	69 ms	93672 KB	Output is correct
27	Correct	46 ms	93672 KB	Output is correct
28	Correct	56 ms	93668 KB	Output is correct
29	Correct	73 ms	93668 KB	Output is correct
30	Correct	39 ms	93536 KB	Output is correct
31	Correct	53 ms	93668 KB	Output is correct
32	Correct	59 ms	93668 KB	Output is correct
33	Correct	56 ms	93668 KB	Output is correct
34	Correct	53 ms	93668 KB	Output is correct
35	Correct	59 ms	93800 KB	Output is correct
36	Correct	46 ms	93668 KB	Output is correct
37	Correct	63 ms	93800 KB	Output is correct
38	Correct	79 ms	93932 KB	Output is correct
39	Correct	69 ms	93932 KB	Output is correct
40	Correct	73 ms	93932 KB	Output is correct
41	Correct	63 ms	93932 KB	Output is correct
42	Correct	59 ms	93804 KB	Output is correct
43	Correct	56 ms	93804 KB	Output is correct
44	Correct	49 ms	93804 KB	Output is correct
45	Correct	63 ms	93932 KB	Output is correct
46	Correct	66 ms	93932 KB	Output is correct
47	Correct	79 ms	94064 KB	Output is correct
48	Correct	66 ms	94064 KB	Output is correct
49	Correct	39 ms	94064 KB	Output is correct
50	Correct	59 ms	93932 KB	Output is correct
51	Correct	79 ms	94328 KB	Output is correct
52	Correct	103 ms	94328 KB	Output is correct
53	Correct	66 ms	94196 KB	Output is correct
54	Correct	29 ms	93536 KB	Output is correct
55	Correct	49 ms	93536 KB	Output is correct
56	Correct	69 ms	94592 KB	Output is correct
57	Correct	83 ms	93800 KB	Output is correct
58	Correct	43 ms	93804 KB	Output is correct
59	Correct	83 ms	93804 KB	Output is correct
60	Correct	86 ms	93800 KB	Output is correct
61	Correct	69 ms	93800 KB	Output is correct
62	Runtime error	53 ms	94592 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
63	Halted	0 ms	0 KB	-

답안 #35693

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 21.0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
21.0 / 21.0

Subtask #5
0 / 43.0