oj.uz

답안 #534102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534102 2022-03-08T01:09:12 Z Killer2501 Intercastellar (JOI22_ho_t1) C++14
100 / 100
 103 ms 19488 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
const int N = 3e5+5;
const int M = 55;
const int mod = 998244353;
const ll base = 75;
const ll inf = 1e12+7;
int n, t, cnt, d[N], c[N], id[N], P[N][20];
int h[N], lab[N];

ll ans, tong, m, k, a[N], b[N];
vector<pii> adj[N];
vector<ll> vi;
vector<int> gr[N];
string s;
bool vis[N];
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n&1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
struct edge
{
    int x, y;
    ll w;
    edge(int _x, int _y, ll _w)
    {
        x = _x;
        y = _y;
        w = _w;
    }
    bool operator < (const edge& e)
    {
        return w < e.w;
    }
};
vector<edge> q;
int findp(int u)
{
    return lab[u] < 0 ? u : lab[u] = findp(lab[u]);
}
bool hop(int u, int v)
{
    u = findp(u);
    v = findp(v);
    if(u == v)return false;
    if(lab[u] > lab[v])swap(u, v);
    lab[u] += lab[v];
    lab[v] = u;
    return true;
}
struct BIT
{
    int n;
    vector<pll> fe;
    BIT(){}
    void init(int _n)
    {
        n = _n;
        fe.assign(n+1, make_pair(inf, 0));
    }
    void add(int id, pll x)
    {
        for(; id <= n; id += id & -id)fe[id] = min(fe[id], x);
    }
    pll get(int id)
    {
        pll res = {inf, 0};
        for(; id; id -= id & -id)res = min(res, fe[id]);
        return res;
    }
};
pll p[N];
bool cmp(const int& x, const int& y)
{
    return (p[x].fi < p[y].fi) || (p[x].fi == p[y].fi && p[x].se < p[y].se);
}
void findegde()
{
    BIT bit;
    for(int j = 0; j < 4; j ++)
    {
        if(j == 2)for(int i = 1; i <= n; i ++)p[i].fi *= -1;
        if(j&1)for(int i = 1; i <= n; i ++)swap(p[i].fi, p[i].se);
        vi.clear();
        for(int i = 1; i <= n; i ++)vi.pb(p[i].fi-p[i].se);
        sort(vi.begin(), vi.end());
        vi.erase(unique(vi.begin(), vi.end()), vi.end());
        sort(id+1, id+1+n, cmp);
        bit.init(n);
        for(int i = n; i > 0; i --)
        {
            k = lower_bound(vi.begin(), vi.end(), p[id[i]].fi-p[id[i]].se) - vi.begin() + 1;
            pll res = bit.get(k);
            if(res.fi < inf)
            {
                tong = abs(p[id[i]].fi-p[res.se].fi) + abs(p[id[i]].se-p[res.se].se);
                q.pb(edge(id[i], res.se, tong));

            }
            bit.add(k, make_pair(p[id[i]].fi+p[id[i]].se, id[i]));
        }
    }
}

void sol()
{
    cin >> n;
    for(int i = 1; i <= n; i ++)
    {
        cin >> a[i];
        b[i] = 1;
        while(a[i] % 2 == 0)
        {
            b[i] *= 2;
            a[i] /= 2;
        }
        b[i] += b[i-1];
    }
    cin >> m;
    while(m -- > 0)
    {
        cin >> k;
        int j = lower_bound(b+1, b+1+n, k) - b;
        cout << a[j] << '\n';
    }

}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    #define task "test"
    if(fopen(task".inp", "r"))
	{
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}
    int test = 1;
    //cin >> test;
    while(test -- > 0)sol();
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:150:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  150 |   freopen(task".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:151:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  151 |   freopen(task".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 27 ms 17484 KB Output is correct
4 Correct 39 ms 15384 KB Output is correct
5 Correct 62 ms 17888 KB Output is correct
6 Correct 37 ms 17120 KB Output is correct
7 Correct 56 ms 17928 KB Output is correct
8 Correct 60 ms 17876 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 7 ms 14432 KB Output is correct
3 Correct 10 ms 14344 KB Output is correct
4 Correct 9 ms 14336 KB Output is correct
5 Correct 8 ms 14432 KB Output is correct
6 Correct 10 ms 14440 KB Output is correct
7 Correct 7 ms 14412 KB Output is correct
8 Correct 8 ms 14472 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Correct 7 ms 14412 KB Output is correct
11 Correct 8 ms 14412 KB Output is correct
12 Correct 8 ms 14456 KB Output is correct
13 Correct 8 ms 14336 KB Output is correct
14 Correct 8 ms 14412 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14412 KB Output is correct
2 Correct 8 ms 14412 KB Output is correct
3 Correct 27 ms 17484 KB Output is correct
4 Correct 39 ms 15384 KB Output is correct
5 Correct 62 ms 17888 KB Output is correct
6 Correct 37 ms 17120 KB Output is correct
7 Correct 56 ms 17928 KB Output is correct
8 Correct 60 ms 17876 KB Output is correct
9 Correct 8 ms 14412 KB Output is correct
10 Correct 7 ms 14432 KB Output is correct
11 Correct 10 ms 14344 KB Output is correct
12 Correct 9 ms 14336 KB Output is correct
13 Correct 8 ms 14432 KB Output is correct
14 Correct 10 ms 14440 KB Output is correct
15 Correct 7 ms 14412 KB Output is correct
16 Correct 8 ms 14472 KB Output is correct
17 Correct 8 ms 14412 KB Output is correct
18 Correct 7 ms 14412 KB Output is correct
19 Correct 8 ms 14412 KB Output is correct
20 Correct 8 ms 14456 KB Output is correct
21 Correct 8 ms 14336 KB Output is correct
22 Correct 8 ms 14412 KB Output is correct
23 Correct 36 ms 16056 KB Output is correct
24 Correct 41 ms 17316 KB Output is correct
25 Correct 84 ms 19488 KB Output is correct
26 Correct 53 ms 17000 KB Output is correct
27 Correct 51 ms 17032 KB Output is correct
28 Correct 87 ms 18624 KB Output is correct
29 Correct 82 ms 17936 KB Output is correct
30 Correct 48 ms 15392 KB Output is correct
31 Correct 103 ms 18364 KB Output is correct