제출 #381713

#제출 시각아이디문제언어결과실행 시간메모리
381713ignaciocanta곤돌라 (IOI14_gondola)C++14
25 / 100
16 ms2028 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; using tint = long long; using ld = long double; #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) using pi = pair<int,int>; using pl = pair<tint,tint>; using vi = vector<int>; using vpi = vector<pi>; using vpl = vector<pl>; using vvi = vector<vi>; using vl = vector<tint>; using vb = vector<bool>; #define pb push_back #define pf push_front #define rsz resize #define all(x) begin(x), end(x) #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)(x).size() #define ins insert #define f first #define s second #define mp make_pair #define DBG(x) cerr << #x << " = " << x << endl; const int MOD = 1e9+7; const tint mod = 998244353; const int MX = 5005; const tint INF = 1e18; const int inf = 2e9; const ld PI = acos(ld(-1)); const ld eps = 1e-5; const int dx[4] = {1, -1, 0, 0}; const int dy[4] = {0, 0, 1, -1}; template<class T> void remDup(vector<T> &v){ sort(all(v)); v.erase(unique(all(v)),end(v)); } template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } bool valid(int x, int y, int n, int m){ return (0<=x && x<n && 0<=y && y<m); } int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redondea p abajo void NACHO(string name = ""){ ios_base::sync_with_stdio(0); cin.tie(0); if(sz(name)){ freopen((name+".in").c_str(), "r", stdin); freopen((name+".out").c_str(), "w", stdout); } } int valid(int n, int a[]) { // si algun numero aparece dos veces, no se puede. // si hay dos numeros <= n (no se cambiaron), hay // que chequear que sean validos // si son todos >= n o todos excepto 1, no hay forma de verificar nada. int id[100005]; vi c (250005, 0); F0R(i, n) ++c[a[i]]; F0R(i, 250005) if(c[i] > 1) return 0; int pos = -1; F0R(i, n) if(a[i] <= n) pos = i; if(pos == -1) return 1; int num = a[pos]-1; FOR(i, pos, n) id[i] = ++num; num = 0; FOR(i, pos-a[pos]+1, pos) id[i] = ++num; num = a[pos]; F0R(i, pos-a[pos]+1) id[i] = ++num; F0R(i, n) if(a[i] <= n && a[i] != id[i]) return 0; return 1; } //---------------------- int replacement(int n, int a[], int replacementSeq[]) { bool allG = 1; F0R(i, n) if(a[i] <= n) allG = 0; if(allG){ F0R(i, 1e9){ allG = 0; } }else{ // uso el pivot para saber que gondola cambiada se corresponde // con que gondola original int pos; int id[100005]; F0R(i, n) if(a[i] <= n) pos = i; int num = a[pos]-1; FOR(i, pos, n) id[i] = ++num; num = 0; FOR(i, pos-a[pos]+1, pos) id[i] = ++num; num = a[pos]; F0R(i, pos-a[pos]+1) id[i] = ++num; vpi g; F0R(i, n){ if(a[i] > n) g.pb(mp(a[i], i)); } if(sz(g) == 0) return 0; sort(all(g)); int cur = id[g[0].s]; int ind = 0; F0R(i, sz(g)){ while(cur < g[i].f){ replacementSeq[ind] = cur; if(cur < n) cur = n+1; else ++cur; ++ind; } } return ind; } } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }

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

gondola.cpp: In function 'void NACHO(std::string)':
gondola.cpp:70:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   70 |         freopen((name+".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gondola.cpp:71:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   71 |         freopen((name+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:138:1: warning: control reaches end of non-void function [-Wreturn-type]
  138 | }
      | ^
gondola.cpp:111:7: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
  111 |   int pos;
      |       ^~~
#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...