oj.uz

Submission #861713

# Submission time Handle Problem Language Result Execution time Memory
861713 2023-10-16T17:26:52 Z gurkot Overtaking (IOI23_overtaking) C++17
65 / 100
 3500 ms 39248 KB 
#include "overtaking.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n,m,x;
pair <long long, int> tmp[1001];
long long t[1001][1001]; int w[1001][1001];
int s[1001];

void init(int L, int N, std::vector<long long> T, std::vector<int> W, 
          int X, int M, std::vector<int> S) {
 n=0; m=M; x=X; 
 
 for (int i=0;i<N;i++){
  tmp[i].first=T[i]; tmp[i].second=W[i];
 }
 
 sort(tmp,tmp+N);
 
 for (int i=0;i<N;i++) {
  T[i]=tmp[i].first; W[i]=tmp[i].second;
 }
  
 for (int i=0;i<M;i++) s[i]=S[i];
 int nom;
 
 for (int i=0;i<N;i++)
  if (W[i]>X) {
  	w[0][n]=W[i];t[0][n]=T[i];
  	nom=n;
  	while (nom>0) 
	 if (t[0][nom]==t[0][nom-1] && w[0][nom]<w[0][nom-1])
  	  {swap(t[0][nom],t[0][nom-1]);swap(w[0][nom],w[0][nom-1]);nom--;}
  	 else break; 
  	n++;
  } 
  
  //counting without reserve bus (precalculation)
  for (int i=1;i<m;i++) {
   w[i][0]=w[i-1][0];
   t[i][0]=t[i-1][0]+(long long)w[i][0]*(s[i]-s[i-1]);    
  
   for (int j=1;j<n;j++){
   	w[i][j]=w[i-1][j];
   	t[i][j]=max(t[i][j-1],t[i-1][j]+(long long)w[i-1][j]*(s[i]-s[i-1]));
   	nom=j;
   	while (nom>0) 
	 if (t[i][nom]==t[i][nom-1] && w[i][nom]<w[i][nom-1])
  	  {swap(t[i][nom],t[i][nom-1]);swap(w[i][nom],w[i][nom-1]);nom--;}
  	 else break; 
   }
    
  }//i
  
 return;
}

long long arrival_time(long long Y){
 long long rt=Y;	
 int nomr=n;
 while (nomr>0)
  if (rt<=t[0][nomr-1]) nomr--;
  else break;
 if (nomr==0) return rt+(long long)s[m-1]*x;
 
 for (int i=1;i<m;i++){
  rt=max(rt+(long long)(s[i]-s[i-1])*x,t[i][nomr-1]);
  while (nomr>0)
   if (rt==t[i][nomr-1]) nomr--;
   else break;
  if (nomr==0) return rt+(long long)(s[m-1]-s[i])*x; 
 	
 }//i  
	
 return rt;
}

Compilation message

overtaking.cpp: In function 'void init(int, int, std::vector<long long int>, std::vector<int>, int, int, std::vector<int>)':
overtaking.cpp:28:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   28 |  for (int i=0;i<N;i++)
      |  ^~~
overtaking.cpp:40:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   40 |   for (int i=1;i<m;i++) {
      |   ^~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 3 ms 10844 KB Output is correct
8 Correct 3 ms 11352 KB Output is correct
9 Correct 3 ms 11356 KB Output is correct
10 Correct 4 ms 11356 KB Output is correct
11 Correct 2 ms 11356 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6744 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6748 KB Output is correct
23 Correct 1 ms 6744 KB Output is correct
24 Correct 1 ms 6748 KB Output is correct
25 Correct 1 ms 6744 KB Output is correct
26 Correct 1 ms 6748 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6748 KB Output is correct
29 Correct 1 ms 6744 KB Output is correct
30 Correct 1 ms 6748 KB Output is correct
31 Correct 1 ms 6748 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 1 ms 6748 KB Output is correct
35 Correct 1 ms 6748 KB Output is correct
36 Correct 1 ms 6748 KB Output is correct
37 Correct 1 ms 6748 KB Output is correct
38 Correct 1 ms 4700 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 1 ms 6748 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 3 ms 10844 KB Output is correct
9 Correct 3 ms 11352 KB Output is correct
10 Correct 3 ms 11356 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6744 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 6748 KB Output is correct
25 Correct 1 ms 6748 KB Output is correct
26 Correct 1 ms 6748 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6748 KB Output is correct
29 Correct 1 ms 6748 KB Output is correct
30 Correct 1 ms 6744 KB Output is correct
31 Correct 1 ms 6748 KB Output is correct
32 Correct 1 ms 6744 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 1 ms 6748 KB Output is correct
35 Correct 1 ms 6748 KB Output is correct
36 Correct 1 ms 6744 KB Output is correct
37 Correct 1 ms 6748 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 1 ms 6748 KB Output is correct
40 Correct 1 ms 6748 KB Output is correct
41 Correct 1 ms 6748 KB Output is correct
42 Correct 1 ms 6748 KB Output is correct
43 Correct 1 ms 6748 KB Output is correct
44 Correct 1 ms 6748 KB Output is correct
45 Correct 1 ms 4700 KB Output is correct
46 Correct 1 ms 4700 KB Output is correct
47 Correct 1 ms 6748 KB Output is correct
48 Correct 9 ms 12124 KB Output is correct
49 Correct 23 ms 12308 KB Output is correct
50 Correct 21 ms 12120 KB Output is correct
51 Correct 21 ms 12124 KB Output is correct
52 Correct 22 ms 12236 KB Output is correct
53 Correct 23 ms 12120 KB Output is correct
54 Correct 21 ms 12120 KB Output is correct
55 Correct 11 ms 12124 KB Output is correct
56 Correct 27 ms 12304 KB Output is correct
57 Correct 23 ms 12124 KB Output is correct
58 Correct 23 ms 12304 KB Output is correct
59 Correct 22 ms 12124 KB Output is correct
60 Correct 24 ms 12308 KB Output is correct
61 Correct 22 ms 12296 KB Output is correct
62 Correct 7 ms 11612 KB Output is correct
63 Correct 3 ms 2652 KB Output is correct
64 Correct 30 ms 12284 KB Output is correct
65 Correct 21 ms 8796 KB Output is correct
66 Correct 22 ms 12284 KB Output is correct
67 Correct 37 ms 12376 KB Output is correct
68 Correct 31 ms 12120 KB Output is correct
69 Correct 21 ms 12120 KB Output is correct
70 Correct 19 ms 12124 KB Output is correct
71 Correct 22 ms 12120 KB Output is correct
72 Correct 21 ms 12124 KB Output is correct
73 Correct 21 ms 12124 KB Output is correct
74 Correct 22 ms 12304 KB Output is correct
75 Correct 3 ms 11356 KB Output is correct
76 Correct 3 ms 11356 KB Output is correct
77 Correct 4 ms 11356 KB Output is correct
78 Correct 17 ms 12304 KB Output is correct

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 3 ms 10844 KB Output is correct
9 Correct 3 ms 11352 KB Output is correct
10 Correct 3 ms 11356 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 2 ms 11356 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6748 KB Output is correct
29 Correct 1 ms 6748 KB Output is correct
30 Correct 1 ms 6748 KB Output is correct
31 Correct 1 ms 6748 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 1 ms 6744 KB Output is correct
34 Correct 1 ms 6748 KB Output is correct
35 Correct 1 ms 6748 KB Output is correct
36 Correct 1 ms 6748 KB Output is correct
37 Correct 1 ms 6748 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 1 ms 6748 KB Output is correct
40 Correct 1 ms 6748 KB Output is correct
41 Correct 1 ms 6744 KB Output is correct
42 Correct 1 ms 6748 KB Output is correct
43 Correct 1 ms 6744 KB Output is correct
44 Correct 1 ms 6748 KB Output is correct
45 Correct 1 ms 6748 KB Output is correct
46 Correct 1 ms 6748 KB Output is correct
47 Correct 1 ms 6744 KB Output is correct
48 Correct 1 ms 6748 KB Output is correct
49 Correct 1 ms 6748 KB Output is correct
50 Correct 1 ms 6748 KB Output is correct
51 Correct 1 ms 6748 KB Output is correct
52 Correct 1 ms 6748 KB Output is correct
53 Correct 1 ms 6748 KB Output is correct
54 Correct 1 ms 6748 KB Output is correct
55 Correct 1 ms 6748 KB Output is correct
56 Correct 1 ms 4700 KB Output is correct
57 Correct 1 ms 4700 KB Output is correct
58 Correct 1 ms 6748 KB Output is correct
59 Correct 9 ms 12124 KB Output is correct
60 Correct 23 ms 12308 KB Output is correct
61 Correct 21 ms 12120 KB Output is correct
62 Correct 21 ms 12124 KB Output is correct
63 Correct 22 ms 12236 KB Output is correct
64 Correct 23 ms 12120 KB Output is correct
65 Correct 21 ms 12120 KB Output is correct
66 Correct 11 ms 12124 KB Output is correct
67 Correct 27 ms 12304 KB Output is correct
68 Correct 23 ms 12124 KB Output is correct
69 Correct 23 ms 12304 KB Output is correct
70 Correct 22 ms 12124 KB Output is correct
71 Correct 24 ms 12308 KB Output is correct
72 Correct 22 ms 12296 KB Output is correct
73 Correct 7 ms 11612 KB Output is correct
74 Correct 3 ms 2652 KB Output is correct
75 Correct 30 ms 12284 KB Output is correct
76 Correct 21 ms 8796 KB Output is correct
77 Correct 22 ms 12284 KB Output is correct
78 Correct 37 ms 12376 KB Output is correct
79 Correct 31 ms 12120 KB Output is correct
80 Correct 21 ms 12120 KB Output is correct
81 Correct 19 ms 12124 KB Output is correct
82 Correct 22 ms 12120 KB Output is correct
83 Correct 21 ms 12124 KB Output is correct
84 Correct 21 ms 12124 KB Output is correct
85 Correct 22 ms 12304 KB Output is correct
86 Correct 3 ms 11356 KB Output is correct
87 Correct 3 ms 11356 KB Output is correct
88 Correct 4 ms 11356 KB Output is correct
89 Correct 17 ms 12304 KB Output is correct
90 Correct 444 ms 14572 KB Output is correct
91 Correct 3001 ms 38224 KB Output is correct
92 Correct 3078 ms 37964 KB Output is correct
93 Correct 2890 ms 38508 KB Output is correct
94 Correct 3051 ms 38392 KB Output is correct
95 Correct 2910 ms 38188 KB Output is correct
96 Correct 2898 ms 38252 KB Output is correct
97 Correct 581 ms 14580 KB Output is correct
98 Correct 3235 ms 38092 KB Output is correct
99 Correct 3236 ms 39248 KB Output is correct
100 Correct 3272 ms 38228 KB Output is correct
101 Execution timed out 3501 ms 37784 KB Time limit exceeded
102 Halted 0 ms 0 KB -