oj.uz

Submission #975216

# Submission time Handle Problem Language Result Execution time Memory
975216 2024-05-04T15:00:03 Z StefanSebez Ancient Books (IOI17_books) C++14
0 / 100
 79 ms 4180 KB 
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
long long minimum_walk(std::vector<int> p, int s){
	int n=p.size();ll res=0;
	for(int i=0;i<n;i++){
		int j=i;
		int trenutni=p[i];
		while(j<n && p[j]!=i){
			if(trenutni==j){
				trenutni=p[j];
				p[j]=j;
			}
			j++;
		}
		p[j]=trenutni;
		p[i]=i;
		res+=2*(j-i);
		res++;
		for(int k=0;k<n;k++) printf("%i ",p[k]);
		printf("\n");
		bool sortirano=true;
		for(int k=1;k<n;k++){
			if(p[k-1]>p[k]) sortirano=false;
		}
		if(sortirano) break;
		res++;
	}
	res--;
	return res;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 4180 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB secret mismatch
2 Halted 0 ms 0 KB -