oj.uz

Submission #1028615

# Submission time Handle Problem Language Result Execution time Memory
1028615 2024-07-20T06:12:37 Z vjudge1 Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 1000 ms 145528 KB 
#include<bits/stdc++.h>

using namespace std;

const int inf = 1e9;

int main()
{
  int n, m;
  cin >> n >> m;
  
  int dist[n][m];
  for(int i = 0; i < n; i ++)
    for(int j = 0; j < m ; j++)
      dist[i][j] = inf;

  vector<int> L[n];
  int p[m], b[m];
  for(int i = 0; i < m; i ++)
    {
      cin >> b[i] >> p[i];
      L[b[i]].push_back(i);
    }


  deque<pair<int,int> > Q;
  Q.push_back({b[0], 0});
  dist[b[0]][0] = 0;
  while(Q.size())
    {
      int f = Q.front().first, s = Q.front().second;
      Q.pop_front();
      //  cerr << f << ' ' << s << ' ' << dist[f][s] << endl;
      for(int res : L[f])
	if(dist[f][s] < dist[f][res])
	  {
	    dist[f][res] = dist[f][s];
	    Q.push_front({f, res});
	  }

      if(f + p[s] < n && dist[f][s] + 1 < dist[f + p[s]][s])
	{
	  dist[f + p[s]][s] = dist[f][s] + 1;
	  Q.push_front({f + p[s], s});
	}

      if(f - p[s] >= 0 && dist[f][s] + 1 < dist[f - p[s]][s])
	{
	  dist[f - p[s]][s] = dist[f][s] + 1;
	  Q.push_front({f - p[s], s});
	}
    }

  if(dist[b[1]][1] == inf)
    cout << -1 << endl;
  else
    cout << dist[b[1]][1] << endl;
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 424 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 30 ms 1116 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 7 ms 1116 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 27 ms 1252 KB Output is correct
12 Correct 9 ms 1116 KB Output is correct
13 Correct 7 ms 1260 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 180 ms 5636 KB Output is correct
18 Correct 4 ms 7260 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 150 ms 16204 KB Output is correct
21 Correct 2 ms 2140 KB Output is correct
22 Correct 3 ms 5468 KB Output is correct
23 Correct 8 ms 6488 KB Output is correct
24 Correct 83 ms 14424 KB Output is correct
25 Correct 15 ms 15960 KB Output is correct
26 Correct 148 ms 15964 KB Output is correct
27 Correct 74 ms 16152 KB Output is correct
28 Correct 10 ms 16220 KB Output is correct
29 Correct 10 ms 6236 KB Output is correct
30 Correct 2 ms 2040 KB Output is correct
31 Correct 6 ms 4956 KB Output is correct
32 Correct 3 ms 4188 KB Output is correct
33 Correct 34 ms 15964 KB Output is correct
34 Correct 36 ms 15964 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 24 ms 1260 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 8 ms 1116 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 177 ms 5468 KB Output is correct
18 Correct 4 ms 7260 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 142 ms 16220 KB Output is correct
21 Correct 2 ms 2140 KB Output is correct
22 Correct 5 ms 5444 KB Output is correct
23 Correct 8 ms 6492 KB Output is correct
24 Correct 73 ms 14544 KB Output is correct
25 Correct 15 ms 15964 KB Output is correct
26 Correct 147 ms 15964 KB Output is correct
27 Correct 75 ms 15964 KB Output is correct
28 Correct 10 ms 15960 KB Output is correct
29 Correct 10 ms 6236 KB Output is correct
30 Correct 2 ms 1884 KB Output is correct
31 Correct 4 ms 4896 KB Output is correct
32 Correct 3 ms 4188 KB Output is correct
33 Correct 36 ms 15964 KB Output is correct
34 Correct 37 ms 15960 KB Output is correct
35 Execution timed out 1068 ms 145528 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 400 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 24 ms 1268 KB Output is correct
12 Correct 7 ms 1256 KB Output is correct
13 Correct 7 ms 1116 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 171 ms 5468 KB Output is correct
18 Correct 4 ms 7260 KB Output is correct
19 Correct 3 ms 4696 KB Output is correct
20 Correct 150 ms 16196 KB Output is correct
21 Correct 2 ms 2140 KB Output is correct
22 Correct 3 ms 5452 KB Output is correct
23 Correct 8 ms 6492 KB Output is correct
24 Correct 73 ms 14424 KB Output is correct
25 Correct 15 ms 15964 KB Output is correct
26 Correct 148 ms 16152 KB Output is correct
27 Correct 74 ms 16152 KB Output is correct
28 Correct 10 ms 16216 KB Output is correct
29 Correct 10 ms 6236 KB Output is correct
30 Correct 2 ms 1884 KB Output is correct
31 Correct 4 ms 5076 KB Output is correct
32 Correct 3 ms 4188 KB Output is correct
33 Correct 35 ms 15960 KB Output is correct
34 Correct 36 ms 15964 KB Output is correct
35 Execution timed out 1070 ms 145492 KB Time limit exceeded
36 Halted 0 ms 0 KB -