oj.uz

답안 #262826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
262826 2020-08-13T09:29:45 Z SorahISA 무지개나라 (APIO17_rainbow) C++11
0 / 100
 2 ms 768 KB 
#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = std::priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back
#define fastIO() ios_base::sync_with_stdio(false), cin.tie(0)

const int maxn = 1 << 18;

int arr[5][maxn];
vector<pii> vec[5];

void init(int R, int C, int sr, int sc, int M, char *S) {
    arr[sr][sc] = 1;
    for (int i = 0; i < M; ++i) {
        if (S[i] == 'N') --sr;
        if (S[i] == 'S') ++sr;
        if (S[i] == 'W') --sc;
        if (S[i] == 'E') ++sc;
        arr[sr][sc] = 1;
    }
    
    int lst1 = 1, lst2 = 1;
    for (int i = 1; i <= C; ++i) {
        if ( arr[1][i] and !arr[1][i + 1]) lst1 = i + 1;
        if (!arr[1][i] and  arr[1][i + 1]) vec[1].eb(lst1, i);
        if ( arr[2][i] and !arr[2][i + 1]) lst2 = i + 1;
        if (!arr[2][i] and  arr[2][i + 1]) vec[2].eb(lst2, i);
    }
    if (!arr[1][C]) vec[1].eb(lst1, C);
    if (!arr[2][C]) vec[2].eb(lst2, C);
}

int colour(int ar, int ac, int br, int bc) {
    int cnt1L, cnt1R, cnt2L, cnt2R;
    
    if (lower_bound(ALL(vec[1]), pii{ac, 0}) != vec[1].begin() and
        (*prev(lower_bound(ALL(vec[1]), pii{ac, 0}))).Y >= ac) {
        cnt1L = lower_bound(ALL(vec[1]), pii{ac, 0}) - vec[1].begin() - 1;
    }
    else {
        cnt1L = lower_bound(ALL(vec[1]), pii{ac, 0}) - vec[1].begin();
    }
    cnt1R = upper_bound(ALL(vec[1]), pii{bc, 0}) - vec[1].begin() - 1;
    
    if (lower_bound(ALL(vec[2]), pii{ac, 0}) != vec[2].begin() and
        (*prev(lower_bound(ALL(vec[2]), pii{ac, 0}))).Y >= ac) {
        cnt2L = lower_bound(ALL(vec[2]), pii{ac, 0}) - vec[2].begin() - 1;
    }
    else {
        cnt2L = lower_bound(ALL(vec[2]), pii{ac, 0}) - vec[2].begin();
    }
    cnt2R = upper_bound(ALL(vec[2]), pii{bc, 0}) - vec[2].begin() - 1;
    
    int ans = (ar == 1 ? cnt1R - cnt1L + 1 : 0LL) + (br == 2 ? cnt2R - cnt2L + 1 : 0LL);
    if (ar == 1 and br == 2) {
        ans -= cnt1L == 0 and cnt2L == 0;
        ans -= cnt1R == vec[1].size() and cnt2R == vec[2].size();
    }
    
    return ans;
}

Compilation message

rainbow.cpp: In function 'int colour(int, int, int, int)':
rainbow.cpp:70:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         ans -= cnt1R == vec[1].size() and cnt2R == vec[2].size();
      |                ~~~~~~^~~~~~~~~~~~~~~~
rainbow.cpp:70:49: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         ans -= cnt1R == vec[1].size() and cnt2R == vec[2].size();
      |                                           ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Runtime error 2 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -