oj.uz

답안 #780385

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
780385 2023-07-12T08:39:51 Z fatemetmhr 곤돌라 (IOI14_gondola) C++17
20 / 100
 16 ms 1740 KB 
//  ~ Be Name Khoda ~  //

#include "gondola.h"
#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  5e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  1e3   + 10;
const int mod   =  1e9   + 7;
const ll  inf   =  1e18;

vector <int> av, num;


int valid(int n, int a[])
{
    for(int i =0 ; i < n; i++){
        a[i]--;
        num.pb(a[i]);
    }
    sort(all(num));
    num.resize(unique(all(num)) - num.begin());
    if(num.size() != n)
        return 0;
    for(int i = 0; i < n; i++) if(a[i] < n)
        av.pb(i);
    int mnid = 0;
    if(av.empty())
        return 1;
    for(int i = 0; i < av.size(); i++) if(a[av[i]] < a[av[mnid]])
        mnid = i;
    int keep = mnid;
    //cout << av.size() << endl;
    for(int i = 0; i < av.size(); i++){
        int nxt = mnid + 1;
        if(nxt == av.size())
            nxt = 0;
        int u = av[mnid], v = av[nxt];
        //cout << "here " << mnid << ' ' << nxt << ' ' << u << ' ' << v << endl;
        if((nxt != keep && a[u] > a[v]) || (n + a[v] - a[u]) % n != (v - u + n) % n)
            return 0;
        mnid = nxt;
    }
    return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{

}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:37:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |     if(num.size() != n)
      |        ~~~~~~~~~~~^~~~
gondola.cpp:44:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i = 0; i < av.size(); i++) if(a[av[i]] < a[av[mnid]])
      |                    ~~^~~~~~~~~~~
gondola.cpp:48:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int i = 0; i < av.size(); i++){
      |                    ~~^~~~~~~~~~~
gondola.cpp:50:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         if(nxt == av.size())
      |            ~~~~^~~~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:66:1: warning: no return statement in function returning non-void [-Wreturn-type]
   66 | }
      | ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 976 KB Output is correct
7 Correct 16 ms 1280 KB Output is correct
8 Correct 9 ms 1612 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 13 ms 1740 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 976 KB Output is correct
7 Correct 11 ms 1232 KB Output is correct
8 Correct 8 ms 1612 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 13 ms 1740 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 5 ms 724 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 12 ms 1404 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -