oj.uz

답안 #310977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
310977 2020-10-09T00:31:10 Z ant101 Building Skyscrapers (CEOI19_skyscrapers) C++14
8 / 100
 301 ms 18220 KB 
#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>
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[8] = {0,1,0,-1, 1, -1, 1, -1}, dy[8] = {1,0,-1,0, 1, 1, -1, -1};


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);
}

ll N, T;

pl coords[MX];
vl adj[MX];
map<ll, map<ll, ll>> m;
ll vis[MX];

int main() {
    setIO();
    re(N, T);
    F0R (i, N) {
        re(coords[i].f, coords[i].s);
        if (!m.count(coords[i].f)) {
            map<ll, ll> m2;
            m[coords[i].f] = m2;
        }
        m[coords[i].f][coords[i].s] = i;
    }
    F0R (i, N) {
        F0R (ii, 8) {
            ll nx = coords[i].f+dx[ii], ny = coords[i].s+dy[ii];
            if (m.count(nx)) {
                if (m[nx].count(ny)) {
                    adj[i].pb(m[nx][ny]);
                }
            }
        }
    }
    ll cnt = 0;
    vl ans;
    F0R (i, N) {
        if (vis[i]) {
            continue;
        } else {
            if (cnt) {
                ps("NO");
                return 0;
            }
            cnt++;
        }
        queue<ll> q;
        q.push(i);
        vis[i] = true;
        while (!q.empty()) {
            ll u = q.front();
            ans.pb(u);
            q.pop();
            trav (v, adj[u]) {
                if (!vis[v]) {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    ps("YES");
    F0R(i, sz(ans)) {
        ps(ans[i]+1);
    }
    return 0;
}

Compilation message

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB ans=YES N=1
2 Correct 4 ms 5120 KB ans=YES N=4
3 Correct 4 ms 4992 KB ans=NO N=4
4 Correct 4 ms 4992 KB ans=YES N=5
5 Correct 4 ms 4992 KB ans=YES N=9
6 Correct 4 ms 4992 KB ans=YES N=5
7 Correct 4 ms 4992 KB ans=NO N=9
8 Correct 3 ms 4992 KB ans=NO N=10
9 Correct 4 ms 4992 KB ans=YES N=10
10 Correct 4 ms 4992 KB ans=YES N=10
11 Correct 4 ms 4992 KB ans=YES N=10
12 Correct 5 ms 5120 KB ans=YES N=9
13 Correct 4 ms 4992 KB ans=YES N=9
14 Correct 4 ms 4992 KB ans=YES N=8
15 Correct 4 ms 4992 KB ans=YES N=8
16 Correct 5 ms 4992 KB ans=NO N=2

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB ans=YES N=1
2 Correct 4 ms 5120 KB ans=YES N=4
3 Correct 4 ms 4992 KB ans=NO N=4
4 Correct 4 ms 4992 KB ans=YES N=5
5 Correct 4 ms 4992 KB ans=YES N=9
6 Correct 4 ms 4992 KB ans=YES N=5
7 Correct 4 ms 4992 KB ans=NO N=9
8 Correct 3 ms 4992 KB ans=NO N=10
9 Correct 4 ms 4992 KB ans=YES N=10
10 Correct 4 ms 4992 KB ans=YES N=10
11 Correct 4 ms 4992 KB ans=YES N=10
12 Correct 5 ms 5120 KB ans=YES N=9
13 Correct 4 ms 4992 KB ans=YES N=9
14 Correct 4 ms 4992 KB ans=YES N=8
15 Correct 4 ms 4992 KB ans=YES N=8
16 Correct 5 ms 4992 KB ans=NO N=2
17 Correct 4 ms 4992 KB ans=YES N=17
18 Correct 4 ms 5120 KB ans=YES N=25
19 Correct 4 ms 4992 KB ans=YES N=100
20 Correct 4 ms 5120 KB ans=YES N=185
21 Correct 4 ms 5120 KB ans=NO N=174
22 Correct 4 ms 5120 KB ans=YES N=90
23 Correct 4 ms 4992 KB ans=YES N=63
24 Correct 4 ms 4992 KB ans=YES N=87
25 Correct 4 ms 5120 KB ans=YES N=183
26 Correct 4 ms 5120 KB ans=YES N=188
27 Correct 4 ms 5120 KB ans=YES N=183
28 Correct 4 ms 5120 KB ans=YES N=189
29 Correct 4 ms 5120 KB ans=YES N=200
30 Correct 4 ms 5120 KB ans=YES N=190
31 Correct 4 ms 5120 KB ans=YES N=187
32 Correct 5 ms 5120 KB ans=YES N=187
33 Correct 5 ms 5120 KB ans=YES N=182
34 Correct 4 ms 5120 KB ans=YES N=184
35 Correct 4 ms 5120 KB ans=YES N=188
36 Correct 4 ms 5120 KB ans=YES N=181
37 Correct 4 ms 5120 KB ans=YES N=188
38 Correct 4 ms 5120 KB ans=YES N=191
39 Incorrect 4 ms 5120 KB Added cell 196 (16,2) not reachable from infinity
40 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB ans=YES N=1
2 Correct 4 ms 5120 KB ans=YES N=4
3 Correct 4 ms 4992 KB ans=NO N=4
4 Correct 4 ms 4992 KB ans=YES N=5
5 Correct 4 ms 4992 KB ans=YES N=9
6 Correct 4 ms 4992 KB ans=YES N=5
7 Correct 4 ms 4992 KB ans=NO N=9
8 Correct 3 ms 4992 KB ans=NO N=10
9 Correct 4 ms 4992 KB ans=YES N=10
10 Correct 4 ms 4992 KB ans=YES N=10
11 Correct 4 ms 4992 KB ans=YES N=10
12 Correct 5 ms 5120 KB ans=YES N=9
13 Correct 4 ms 4992 KB ans=YES N=9
14 Correct 4 ms 4992 KB ans=YES N=8
15 Correct 4 ms 4992 KB ans=YES N=8
16 Correct 5 ms 4992 KB ans=NO N=2
17 Correct 4 ms 4992 KB ans=YES N=17
18 Correct 4 ms 5120 KB ans=YES N=25
19 Correct 4 ms 4992 KB ans=YES N=100
20 Correct 4 ms 5120 KB ans=YES N=185
21 Correct 4 ms 5120 KB ans=NO N=174
22 Correct 4 ms 5120 KB ans=YES N=90
23 Correct 4 ms 4992 KB ans=YES N=63
24 Correct 4 ms 4992 KB ans=YES N=87
25 Correct 4 ms 5120 KB ans=YES N=183
26 Correct 4 ms 5120 KB ans=YES N=188
27 Correct 4 ms 5120 KB ans=YES N=183
28 Correct 4 ms 5120 KB ans=YES N=189
29 Correct 4 ms 5120 KB ans=YES N=200
30 Correct 4 ms 5120 KB ans=YES N=190
31 Correct 4 ms 5120 KB ans=YES N=187
32 Correct 5 ms 5120 KB ans=YES N=187
33 Correct 5 ms 5120 KB ans=YES N=182
34 Correct 4 ms 5120 KB ans=YES N=184
35 Correct 4 ms 5120 KB ans=YES N=188
36 Correct 4 ms 5120 KB ans=YES N=181
37 Correct 4 ms 5120 KB ans=YES N=188
38 Correct 4 ms 5120 KB ans=YES N=191
39 Incorrect 4 ms 5120 KB Added cell 196 (16,2) not reachable from infinity
40 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5376 KB ans=NO N=1934
2 Correct 8 ms 5376 KB ans=NO N=1965
3 Incorrect 9 ms 5376 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 595)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB ans=YES N=1
2 Correct 4 ms 5120 KB ans=YES N=4
3 Correct 4 ms 4992 KB ans=NO N=4
4 Correct 4 ms 4992 KB ans=YES N=5
5 Correct 4 ms 4992 KB ans=YES N=9
6 Correct 4 ms 4992 KB ans=YES N=5
7 Correct 4 ms 4992 KB ans=NO N=9
8 Correct 3 ms 4992 KB ans=NO N=10
9 Correct 4 ms 4992 KB ans=YES N=10
10 Correct 4 ms 4992 KB ans=YES N=10
11 Correct 4 ms 4992 KB ans=YES N=10
12 Correct 5 ms 5120 KB ans=YES N=9
13 Correct 4 ms 4992 KB ans=YES N=9
14 Correct 4 ms 4992 KB ans=YES N=8
15 Correct 4 ms 4992 KB ans=YES N=8
16 Correct 5 ms 4992 KB ans=NO N=2
17 Correct 4 ms 4992 KB ans=YES N=17
18 Correct 4 ms 5120 KB ans=YES N=25
19 Correct 4 ms 4992 KB ans=YES N=100
20 Correct 4 ms 5120 KB ans=YES N=185
21 Correct 4 ms 5120 KB ans=NO N=174
22 Correct 4 ms 5120 KB ans=YES N=90
23 Correct 4 ms 4992 KB ans=YES N=63
24 Correct 4 ms 4992 KB ans=YES N=87
25 Correct 4 ms 5120 KB ans=YES N=183
26 Correct 4 ms 5120 KB ans=YES N=188
27 Correct 4 ms 5120 KB ans=YES N=183
28 Correct 4 ms 5120 KB ans=YES N=189
29 Correct 4 ms 5120 KB ans=YES N=200
30 Correct 4 ms 5120 KB ans=YES N=190
31 Correct 4 ms 5120 KB ans=YES N=187
32 Correct 5 ms 5120 KB ans=YES N=187
33 Correct 5 ms 5120 KB ans=YES N=182
34 Correct 4 ms 5120 KB ans=YES N=184
35 Correct 4 ms 5120 KB ans=YES N=188
36 Correct 4 ms 5120 KB ans=YES N=181
37 Correct 4 ms 5120 KB ans=YES N=188
38 Correct 4 ms 5120 KB ans=YES N=191
39 Incorrect 4 ms 5120 KB Added cell 196 (16,2) not reachable from infinity
40 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 16980 KB ans=NO N=66151
2 Correct 165 ms 11512 KB ans=NO N=64333
3 Incorrect 301 ms 18220 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 13970)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5376 KB ans=NO N=1934
2 Correct 8 ms 5376 KB ans=NO N=1965
3 Incorrect 9 ms 5376 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 595)
4 Halted 0 ms 0 KB -