oj.uz

답안 #425501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
425501 2021-06-13T06:05:53 Z Charis02 고대 책들 (IOI17_books) C++14
0 / 100
 2000 ms 204 KB 
#include "books.h"
#include<iostream>
#include<vector>
#include<map>
#define ll long long
#define rep(i,a,b) for(int i = a;i < b;i++)
#define mp(a,b) make_pair(a,b)
#define N 100003

using namespace std;

bool vis[N];

int abso(int x)
{
    return (x < 0) ? -x : x;
}

ll get_cycle_cost(vector < int > c)
{
    if(c.size()==1)
        return 0;

    ll res = 0;

    rep(i,1,c.size())
    {
        res += abso(c[i]-c[i-1]);
    }

    res += abso(c[0]-c[c.size()-1]);

    return res;
}

long long minimum_walk(std::vector<int> p, int s) // for 1st sub
{
    int n = p.size();
    int misplaced = 0;
    int cur = 0;
    int holding = -1;

    rep(i,0,n)
    {
        if(p[i] != i)
            misplaced++;
    }

    ll ans = -1;
    bool dpos = true;

    while(true)
    {
        ans++;
        if(p[cur] != cur)
        {
            int tmp = holding;
            holding = p[cur];
            p[cur] = tmp;
            if(p[cur] == cur)
                misplaced--;
        }

        if(misplaced == 0)
            break;

        if(dpos && cur == n-1)
            dpos = false;
        if(!dpos && cur == 0)
            dpos = true;
        if(dpos)
            cur++;
        else
            cur--;
    }

    ans += cur;

	return ans;
}

Compilation message

books.cpp: In function 'long long int get_cycle_cost(std::vector<int>)':
books.cpp:6:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define rep(i,a,b) for(int i = a;i < b;i++)
......
   26 |     rep(i,1,c.size())
      |         ~~~~~~~~~~~~                
books.cpp:26:5: note: in expansion of macro 'rep'
   26 |     rep(i,1,c.size())
      |     ^~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '8', found: '18'
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '8', found: '18'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '8', found: '18'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2080 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '8', found: '18'
4 Halted 0 ms 0 KB -