oj.uz

답안 #477340

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
477340 2021-10-01T17:34:20 Z Ooops_sorry Colouring a rectangle (eJOI19_colouring) C++14
30 / 100
 155 ms 102404 KB 
#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define ld long double
#define ll long long
#define int long long

mt19937 rnd(51);

int n, m;

bool connect(int i, int j, int ii, int jj){
    set<pair<int,int>> st;
    while(i < n && j < m){
        st.insert({i, j});
        i++, j++;
    }
    while(ii < n && jj >= 0){
        if (st.find({ii, jj}) != st.end()) return 1;
        ii++, jj--;
    }
    return 0;
}

int take_ans(vector<pair<pair<int,int>, int>> a, vector<pair<pair<int,int>, int>> b){
    vector<pair<int,int>> need(b.size());
    vector<vector<vector<int>>> dp(b.size() + 1, vector<vector<int>>(a.size() + 1, vector<int>(a.size() + 1, 1e18)));
    for (int j = 0; j < b.size(); j++){
        vector<int> ind;
        for (int i = 0; i < a.size(); i++){
            if (connect(a[i].first.first, a[i].first.second, b[j].first.first, b[j].first.second)){
                ind.pb(i);
            }
        }
        if (ind.size() > 0){
            need[j] = {ind[0], ind.back()};
        }
    }
    dp[0][a.size()][a.size()] = 0;
    for (int i = 1; i <= b.size(); i++){
        for (int j = 0; j <= a.size(); j++){
            for (int k = 0; k <= a.size(); k++){
                dp[i][j][k] = min(dp[i][j][k], b[i - 1].second + dp[i - 1][j][k]);
                int add = dp[i - 1][j][k];
                if (j == a.size() && k == a.size()){
                    for (int f = need[i - 1].first; f <= need[i - 1].second; f++) add += a[f].second;
                    dp[i][need[i - 1].first][need[i - 1].second] = min(dp[i][need[i - 1].first][need[i - 1].second], add);
                }
                else{
                    if (need[i - 1].second < j || need[i - 1].first > k){
                        for (int f = need[i - 1].first; f <= need[i - 1].second; f++) add += a[f].second;
                        dp[i][need[i - 1].first][need[i - 1].second] = min(dp[i][need[i - 1].first][need[i - 1].second], add);
                    }
                    else{
                        for (int f = k + 1; f <= need[i - 1].second; f++) add += a[f].second;
                        for (int f = need[i - 1].first; f < j; f++) add += a[f].second;
                        dp[i][min(j, need[i - 1].first)][max(k, need[i - 1].second)] = min(dp[i][min(j, need[i - 1].first)][max(k, need[i - 1].second)], add);
                    }
                }
            }
        }
    }
    int ans = 1e18;
    for (int i = 0; i <= a.size(); i++) for (int j = 0; j <= a.size(); j++) ans = min(ans, dp[b.size()][i][j]);
    return ans;
}

signed main()
{
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    vector<pair<pair<int,int>, int>> l0, l1, r0, r1;
    int f = 0, s = m - 1;
    for (int i = 0; i < n + m - 1; i++){
        int a;
        cin >> a;
        if ((f + s) & 1){
            l1.pb({{f, s}, a});
        }
        else{
            l0.pb({{f, s}, a});
        }
        if (s > 0) s--;
        else f++;
    }
    f = 0, s = 0;
    for (int i = 0; i < n + m - 1; i++){
        int a;
        cin >> a;
        if ((f + s) & 1){
            r1.pb({{f, s}, a});
        }
        else{
            r0.pb({{f, s}, a});
        }
        if (s + 1 < m) s++;
        else f++;
    }
    cout << take_ans(l0, r0) + take_ans(l1, r1) << endl;
    return 0;
}

Compilation message

colouring.cpp: In function 'long long int take_ans(std::vector<std::pair<std::pair<long long int, long long int>, long long int> >, std::vector<std::pair<std::pair<long long int, long long int>, long long int> >)':
colouring.cpp:30:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int j = 0; j < b.size(); j++){
      |                     ~~^~~~~~~~~~
colouring.cpp:32:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for (int i = 0; i < a.size(); i++){
      |                         ~~^~~~~~~~~~
colouring.cpp:42:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 1; i <= b.size(); i++){
      |                     ~~^~~~~~~~~~~
colouring.cpp:43:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for (int j = 0; j <= a.size(); j++){
      |                         ~~^~~~~~~~~~~
colouring.cpp:44:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             for (int k = 0; k <= a.size(); k++){
      |                             ~~^~~~~~~~~~~
colouring.cpp:47:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |                 if (j == a.size() && k == a.size()){
      |                     ~~^~~~~~~~~~~
colouring.cpp:47:40: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |                 if (j == a.size() && k == a.size()){
      |                                      ~~^~~~~~~~~~~
colouring.cpp:66:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0; i <= a.size(); i++) for (int j = 0; j <= a.size(); j++) ans = min(ans, dp[b.size()][i][j]);
      |                     ~~^~~~~~~~~~~
colouring.cpp:66:59: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<long long int, long long int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0; i <= a.size(); i++) for (int j = 0; j <= a.size(); j++) ans = min(ans, dp[b.size()][i][j]);
      |                                                         ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 444 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 452 KB Output is correct
27 Correct 0 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 444 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 452 KB Output is correct
27 Correct 0 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Runtime error 52 ms 102404 KB Execution killed with signal 9
31 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 93 ms 102404 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 155 ms 102404 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 444 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 452 KB Output is correct
27 Correct 0 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Runtime error 52 ms 102404 KB Execution killed with signal 9
31 Halted 0 ms 0 KB -