제출 #1026871

#제출 시각아이디문제언어결과실행 시간메모리
1026871MarwenElarbi곤돌라 (IOI14_gondola)C++17
20 / 100
24 ms5072 KiB
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
#define pb push_back
#define se second
#define fi first
const int nax=5e5+5;
const int MOD=1e9+7;
vector<pair<int,int>> tab;
int valid(int n, int inputSeq[])
{
    bool test=true;
    set<int> stt;
    for (int i = 0; i < n; ++i)
    {
        stt.insert(inputSeq[i]);
    }
    test&=(stt.size()==n);
    int cnt=-1e9;
    for (int i = 0; i < n; ++i)
    {
        if(inputSeq[i]<=n){
            cnt=(inputSeq[i]-(i+1)+n)%n;
        }
    }
    if(cnt==-1e9) return test;
    for (int i = 0; i < n; ++i)
    {
        if(inputSeq[i]<=n){
            if((inputSeq[i]-(i+1)+n)%n!=cnt) test=false;
        }
    }
    return test;
}
 
//----------------------
 
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}
 
//----------------------
 
int countReplacement(int n, int inputSeq[])
{
  return -3;
}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:18:22: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   18 |     test&=(stt.size()==n);
      |            ~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...