제출 #163218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163218		galen_colin	동굴 (IOI13_cave)	C++14	64 / 100	385 ms	608 KiB

cave

#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
 
#define f0r(a, b) for (long long a = 0; a < b; a++)
#define f1r(a, b, c) for (long long a = b; a < c; a++)
#define f0rd(a, b) for (long long a = b; a >= 0; a--)
#define f1rd(a, b, c) for (long long a = b; a >= c; a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < n; i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
// template<typename A, typename B> ll max(A x, B y) {
//   return x > y ? x : y;
// }
// template<typename A, typename B> ll min(A x, B y) {
//   return x < y ? x : y;
// }
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
/* usage - just do rng() */
 
void usaco(string filename) {
  #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const ll mod = 998244353;
 
ll madd(ll a, ll b) {
  return (a + b) % mod;
}
ll msub(ll a, ll b) {
  return (((a - b) % mod) + mod) % mod;
}
ll mmul(ll a, ll b) {
  return ((a % mod) * (b % mod)) % mod;
}
ll mpow(ll base, ll exp) {
  ll res = 1;
  while (exp) {
    if (exp % 2 == 1){
        res = (res * base) % mod;
    }
    exp >>= 1;
    base = (base * base) % mod;
  }
  return res;
}
ll minv(ll base) {
  return mpow(base, mod - 2);
}
ll mdiv(ll a, ll b) {
  return mmul(a, minv(b));
}
ll gcd(ll x, ll y) {
  if (x == 0) return y;
  if (y == 0) return x;
  return gcd(y, x % y);
}
 
bool prime[1000006]; 
void sieve(int n) { 
  f0r(i, n + 1) prime[i] = 1;
  for (int p = 2; p * p <= n; p++) { 
    if (prime[p] == true) { 
      for (int i = p * p; i <= n; i += p) 
        prime[i] = false; 
    } 
  } 
  prime[1] = prime[0] = 0;
} 
 
ll n, m, k, q, Q, T, l, r, x, y, z;
ll a[500005];
ll b[500005];
string s, t;
ll ans = 0;

#include "cave.h"

int correct[5005], loc[5005], inv[5005];
int cur[5005], used[5005];
bool oans[4] = {0, 1, 0, 0};
ll oloc[4] = {3, 1, 0, 2};

// int tryCombination(bool s[]) {
//   n = 4;
//   ll ret = n;

//   f0r(i, n) {
//     cout << "try " << oans[oloc[i]] << " " << s[i] << " " << oloc[i] << endl;
//     if (oans[oloc[i]] != s[i]) ret = min(ret, oloc[i]);
//   }
//   cout << "try " << ret << endl;

//   return (ret == n ? -1 : ret);
// } 

void exploreCave(int n) {
  ms(cur, 0);
  ms(loc, 0);
  ms(used, 0);
  ms(correct, 0);

  f0r(i, n) {
    f0r(j, n) {
      if (!used[j]) cur[j] = 0;
      else cur[j] = correct[j];
    }
    int l = 0, r = n - 1;
    bool f;
    bool last = (tryCombination(cur) == i);
    bool now;
    f = (last == i + 1);
    while (l < r) {
      int m = (l + r) / 2;
      f1r(j, l, m + 1) {
        if (!used[j]) cur[j] = !cur[j];
      }
      now = (tryCombination(cur) == i);
      // cout << l << " " << r << " " << m << " " << now << endl;
      if (now ^ last) {
        r = m;
      } else {
        l = m + 1;
      }
      last = now;
    }
    // cout << r << endl;
    correct[r] = cur[r] ^ now;
    loc[r] = i;
    used[r] = 1;
  }

  // f0r(i, n) cout << correct[i] << " " << loc[i] << endl;
  answer(correct, loc);
}
 /*
int main() {
  io;
  // freopen("case", "r", stdin);
  // freopen("test.txt", "r", stdin);
  // freopen("case", "w", stdout);
  // freopen("file.in", "r", stdin);
 
  // usaco("file");
 
  exploreCave(4);
}*/

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

cave.cpp: In function 'void usaco(std::__cxx11::string)':
cave.cpp:54:53: note: #pragma message: be careful, freopen may be wrong
   #pragma message("be careful, freopen may be wrong")
                                                     ^
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:19:11: warning: variable 'first' set but not used [-Wunused-but-set-variable]
 #define f first
           ^
cave.cpp:143:10: note: in expansion of macro 'f'
     bool f;
          ^
cave.cpp: In function 'void usaco(std::__cxx11::string)':
cave.cpp:55:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".in").c_str(), "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cave.cpp:56:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".out").c_str(), "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:162:25: warning: 'now' may be used uninitialized in this function [-Wmaybe-uninitialized]
     correct[r] = cur[r] ^ now;
                  ~~~~~~~^~~~~

• Subtask 1: 0 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 0 / 24