oj.uz

Submission #968540

# Submission time Handle Problem Language Result Execution time Memory
968540 2024-04-23T15:02:54 Z gry3125 Bitaro's travel (JOI23_travel) C++14
5 / 100
 3000 ms 3896 KB 
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

int main() {
	int N;
	cin >> N;
	vector<int> x(N);
	for(int i=0;i<N;i++){
		cin >> x[i];
	} 
	int Q;
	cin >> Q;
	int s;
	int dist;
	vector<int> v(N);
	int a, count;
	int best, min;
	for(int i=0;i<Q;i++){
		cin >> s;
		dist=0;
		count=0;
		fill(v.begin(), v.end(), 0);
		a=find(x.begin(), x.end(), s)-x.begin();
		if(a!=N){
			v[a]=1;
			count++;
		}
		while(count<N){
			min = 1000000000;
			for (int o = 0; o < N; o++) {
			  if (v[o] == 0) {
			    if (abs(s - x[o]) < min) {
			      best = o;
			      min = abs(s - x[o]);
			    }
			  }
			}
			dist+=abs(s - x[best]);
			v[best]=1;
			s=x[best];
			count++;
		}
		cout << dist << "\n";
	}
    return 0;
}

Compilation message

travel.cpp: In function 'int main()':
travel.cpp:42:24: warning: 'best' may be used uninitialized in this function [-Wmaybe-uninitialized]
   42 |    dist+=abs(s - x[best]);
      |                        ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 4 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 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 6 ms 348 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 4 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 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 6 ms 348 KB Output is correct
17 Execution timed out 3054 ms 3896 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 30.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 1 ms 432 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Execution timed out 3089 ms 3156 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 4 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 0 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 4 ms 348 KB Output is correct
16 Correct 6 ms 348 KB Output is correct
17 Execution timed out 3054 ms 3896 KB Time limit exceeded
18 Halted 0 ms 0 KB -