oj.uz

답안 #305647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305647 2020-09-23T17:59:21 Z updown1 Job Scheduling (CEOI12_jobs) C++17
0 / 100
 28 ms 29056 KB 
#include <bits/stdc++.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<db,db> pd;
 
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
 
#define mp make_pair
#define f first
#define s second
#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;
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
//mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
 
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; }
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }
 
template<class T, class U> T fstTrue(T lo, T hi, U f) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true
        T mid = half(lo+hi);
        f(mid) ? hi = mid : lo = mid+1;
    }
    return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true
        T mid = half(lo+hi+1);
        f(mid) ? lo = mid : hi = mid-1;
    }
    return lo;
}
template<class T> void remDup(vector<T>& v) {
    sort(all(v)); v.erase(unique(all(v)),end(v)); }
 
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
 
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
 
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
 
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
    return b ? "true" : "false";
#else
    return ts((int)b);
#endif
}
template<class A> str ts(complex<A> c) {
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
#ifdef LOCAL
    bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
#else
    bool fst = 1; str res = "";
    for (const auto& x: v) {
        if (!fst) res += " ";
        fst = 0; res += ts(x);
    }
    return res;
 
#endif
}
template<class A, class B> str ts(pair<A,B> p) {
#ifdef LOCAL
    return "("+ts(p.f)+", "+ts(p.s)+")";
#else
    return ts(p.f)+" "+ts(p.s);
#endif
}
 
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) {
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) {
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
 
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
 
#define LOCAL
 
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#define assert(...) 0]
#endif
 
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(str s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit);
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
// set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -fsanitize=address")
 
ll N, D, M;
vector<ll> x(M);
 
bool check(int m) {
    vector<ll> machT(m);
 
    F0R(i, M) {
        machT[i % m] = max(machT[i % m] + 1, x[i]);
        if (machT[i % m] > x[i] + D) {
            return false;
        }
    }
    return true;
}
 
 
ll binary_search() {
 
    ll r = M;
    ll l = 1;
    while (l != r) {
        int mid = (l + r)/2;
        if (check(mid)) {
            r = mid;
        }
        else {
            l = mid + 1;
        }
    }
    return l;
}
 
int main() {
 
    cin >> N >> D >> M;
 
    
    vector<pair<ll, int>> jp(M);
 
    F0R(i, M) {
        cin >> x[i];
        jp[i] = {x[i], i};
    }
 
    sort(all(x));
    sort(all(jp), [](pl a, pl b) {if (a.f == b.f) {return a.s > b.s;}
    return a.f < b.f;});
 
    ll machines = binary_search();
    cout << machines << endl;
 
    vector<vector<int>> sim(N + 1);
 
    vector<ll> machT(machines);
 
    F0R(i, M) {
        machT[i % machines] = max(machT[i % machines] + 1, x[i]);
        sim[machT[i % machines]].pb(jp[i].s + 1);
    }
 
    FOR(i, 1, N + 1) {
        F0R(j, sim[i].size()) {
            cout << sim[i][j] << " ";
        }
        cout << 0 << endl;
    }
 
}

Compilation message

jobs.cpp: In function 'int main()':
jobs.cpp:37:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
      |                                        ^
jobs.cpp:38:18: note: in expansion of macro 'FOR'
   38 | #define F0R(i,a) FOR(i,0,a)
      |                  ^~~
jobs.cpp:239:9: note: in expansion of macro 'F0R'
  239 |         F0R(j, sim[i].size()) {
      |         ^~~
jobs.cpp: In function 'void setIn(str)':
jobs.cpp:166:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  166 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
jobs.cpp: In function 'void setOut(str)':
jobs.cpp:167:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  167 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 5 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 5 ms 3712 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 4 ms 3584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 7 ms 6784 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 10 ms 9984 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 14 ms 13056 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 17 ms 16256 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 19 ms 19456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 24 ms 22656 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 26 ms 25848 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 28 ms 29056 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 24 ms 22648 KB Execution killed with signal 11 (could be triggered by violating memory limits)