oj.uz

답안 #39923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39923 2018-01-24T11:56:41 Z krauch OGLEDALA (COI15_ogledala) C++14
0 / 100
 280 ms 33320 KB 
/*
 _    _    _______   _    _
| |  / /  |  _____| | |  / /
| | / /   | |       | | / /
| |/ /    | |_____  | |/ /
| |\ \    |  _____| | |\ \
| | \ \   | |       | | \ \
| |  \ \  | |_____  | |  \ \
|_|   \_\ |_______| |_|   \_\
 
*/
#include <bits/stdc++.h>
 
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef pair <int, int> PII;
typedef pair <ll, ll> PLL;
typedef pair < ll, int > PLI;
 
 
#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define right(x) x << 1 | 1
#define left(x) x << 1
#define forn(x, a, b) for (int x = a; x <= b; ++x)
#define for1(x, a, b) for (int x = a; x >= b; --x)
#define mkp make_pair
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define y1 kekekek
 
#define fname ""
 
const ll ool = 1e18 + 9;
const int oo = 1e9 + 9, base = 1e9 + 7;
const ld eps = 1e-7;
const int N = 2e5 + 6;
 
int n, m;
ll L, ans[N];
PLL a[N];
PLI b[N];
map < PLL, ll > d;
unordered_map < ll, ll > cnt[N];
set < PLI > st;
 
ll get(ll len, ll x) {
    if (d.count(PLL(len, x))) return d[PLL(len, x)];
    if (len == x) return d[PLL(len, x)] = 1;
    if (len < x) return d[PLL(len, x)] = 0;
    return d[PLL(len, x)] = get((len - 1) / 2, x) + get(len / 2, x);
}
 
int main() {
    #ifdef krauch
        freopen("input.txt", "r", stdin);
    #else
        //freopen(fname".in", "r", stdin);
        //freopen(fname".out", "w", stdout);
    #endif
 
    scanf("%I64d%d%d", &L, &n, &m);
    ll last = 0;
    forn(i, 1, n) {
        ll x;
        scanf("%I64d", &x);
        a[i].F = last + 1;
        a[i].S = x - 1;
        if (last < x - 1) {
            cnt[i][x - last - 1]++;
            st.insert(PLI(x - last - 1, n + 1 - i));
        }
        last = x;
    }
    a[n + 1].F = last + 1;
    a[n + 1].S = L;
    if (last != L) {
        cnt[n + 1][L - last]++;
        st.insert(PLI(L - last, 0));
    }
 
    forn(i, 1, m) {
        scanf("%I64d", &b[i].F);
        b[i].F -= n;
        b[i].S = i;
    }
 
    sort(b + 1, b + m + 1);
 
    int ptr = 1;
    ll sum = 0;
 
    forn(i, 1, m) {
        printf("%I64d\n", ans[i]);
    }
 
	return 0;
}

Compilation message

ogledala.cpp: In function 'int main()':
ogledala.cpp:67:34: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
     scanf("%I64d%d%d", &L, &n, &m);
                                  ^
ogledala.cpp:71:26: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
         scanf("%I64d", &x);
                          ^
ogledala.cpp:88:31: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
         scanf("%I64d", &b[i].F);
                               ^
ogledala.cpp:99:33: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
         printf("%I64d\n", ans[i]);
                                 ^
ogledala.cpp:95:9: warning: unused variable 'ptr' [-Wunused-variable]
     int ptr = 1;
         ^
ogledala.cpp:96:8: warning: unused variable 'sum' [-Wunused-variable]
     ll sum = 0;
        ^
ogledala.cpp:67:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%I64d%d%d", &L, &n, &m);
                                   ^
ogledala.cpp:71:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%I64d", &x);
                           ^
ogledala.cpp:88:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%I64d", &b[i].F);
                                ^

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 20780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 20780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 280 ms 33320 KB Output isn't correct
2 Halted 0 ms 0 KB -