제출 #304020

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
304020		ant101	로봇 (IOI13_robots)	C++14	28 / 100	300 ms	17144 KiB

robots

#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
#include <complex>
#include "robots.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define mp make_pair
#define f first
#define s second

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#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)

const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};


namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        // cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        if (sz(s)) {
            setIn(s+".in");
            setOut(s+".out");
        } // for USACO
    }
}

using namespace io;

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }
    
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);
    
    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

using namespace input;

ll add(ll a, ll b) {
    a += b;
    if(a >= MOD) {
        a -= MOD;
    }
    return a;
}
ll sub(ll a, ll b) {
    a -= b;
    if(a < 0) {
        a += MOD;
    }
    return a;
}

ll mul(ll a, ll b) {
    return (a * b)%MOD;
}

void add_self(ll& a, ll b) {
    a = add(a, b);
}
void sub_self(ll& a, ll b) {
    a = sub(a, b);
}
void mul_self(ll& a, ll b) {
    a = mul(a, b);
}

vector<int> xs, ys, as, bs;
int solveb(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    as = vector<int> (A), bs = vector<int> (B), xs = vector<int> (T), ys = vector<int> (T);
    for(int i = 0; i < T; i++) xs[i] = W[i]; //cout << xs[i] << " ";
    for(int i = 0; i < T; i++) ys[i] = S[i];
    for(int i = 0; i < A; i++) as[i] = X[i]; //cout << i << " " << as[i] << " ";
    for(int i = 0; i < B; i++) bs[i] = Y[i];
    sort(xs.begin(), xs.end());
    sort(ys.begin(), ys.end());
    sort(as.begin(), as.end());
    sort(bs.begin(), bs.end());
    if(A == 0 || xs[T-1] >= as[A-1]) return -1;
    int res = 0;
    priority_queue<int> q;
    for(int i = T - 1; i >= 0; i--){
        if(q.empty()) q.push(A-1), res++;
        auto t = q.top(); q.pop();
        if(xs[i] >= as[t]){
            q.push(t);
            if(A > 1) q.push(A-2);
            res++;
        }else if(t > 0) q.push(t-1);
    }
    return res;
}
int solvea(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    as = vector<int> (A), bs = vector<int> (B), xs = vector<int> (T), ys = vector<int> (T);
    for(int i = 0; i < T; i++) xs[i] = W[i]; //cout << xs[i] << " ";
    for(int i = 0; i < T; i++) ys[i] = S[i];
    for(int i = 0; i < A; i++) as[i] = X[i]; //cout << i << " " << as[i] << " ";
    for(int i = 0; i < B; i++) bs[i] = Y[i];
    sort(xs.begin(), xs.end());
    sort(ys.begin(), ys.end());
    sort(as.begin(), as.end());
    sort(bs.begin(), bs.end());
    pair<int,int> m1 = {W[0], S[0]};
    pair<int,int> m2 = {W[1], S[1]};
    if(A == 2){
        if(as[1] > xs[1] && as[0] > xs[0]) return 1;
        else if(as[1] > xs[1]) return 2;
        return -1;
    }else if(B == 2){
        if(bs[1] > ys[1] && bs[0] > ys[0]) return 1;
        else if(bs[1] > ys[1]) return 2;
        return -1;
    }else{
        if(as[0] > m1.first && bs[0] > m2.second) return 1;
        else if(as[0] > m2.first && bs[0] > m1.second) return 1;
        else if(as[0] > m2.first && as[0] > m1.first) return 2;
        else if(bs[0] > m2.second && bs[0] > m1.second) return 2;
        return -1;
    }
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    if(B == 0) return solveb(A, B, T, X, Y, W, S);
    return solvea(A, B, T, X, Y, W, S);
}

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

robots.cpp: In function 'void io::setIn(std::string)':
robots.cpp:68:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   68 |     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
robots.cpp: In function 'void io::setOut(std::string)':
robots.cpp:69:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   69 |     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 0 / 25
• Subtask 4: 0 / 37
• Subtask 5: 0 / 10