oj.uz

답안 #1075991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075991 2024-08-26T10:19:22 Z amin 고대 책들 (IOI17_books) C++14
0 / 100
 1 ms 348 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long minimum_walk(vector<int> p, int s) {
	ll ans=0;
	ll n=p.size();

	int o[n+1];
	for(int i=0;i<=n;i++)
    {
        o[i]=0;
    }
    int pre=0;
   ll mi=1000000;
   ll ma=0;
	for(ll i=0;i<n;i++)
    {
           if(p[i]!=i&&o[i]==0)
           {
               mi=min(mi,i);
               ma=i;
               int x=p[i];
               o[i]=1;
               while(x!=i)
               {

                   o[x]=1;
                   x=p[x];
               }
           }


            ans+=abs(p[i]-i);
    }
if(mi==1000000)
    mi=0;
    return ans+ma+mi;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:36:1: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   36 | if(mi==1000000)
      | ^~
books.cpp:38:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   38 |     return ans+ma+mi;
      |     ^~~~~~
books.cpp:14:9: warning: unused variable 'pre' [-Wunused-variable]
   14 |     int pre=0;
      |         ^~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '9'
7 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '9'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '9'
7 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3736'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '9'
7 Halted 0 ms 0 KB -