oj.uz

Submission #637779

# Submission time Handle Problem Language Result Execution time Memory
637779 2022-09-03T08:19:09 Z ksu2009en Colouring a rectangle (eJOI19_colouring) C++17
0 / 100
 314 ms 6560 KB 
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>

using namespace std;
typedef long long ll;


int main(){
    ll n, m;
    cin >> n >> m;
    
    vector<ll>down(n + m - 1), up(n + m - 1);
    
    for(int i = 0; i < down.size(); i++)
        cin >> down[i];
    
    for(int i = 0; i < up.size(); i++)
        cin >> up[i];
    
    ll ans = 0;
    
    for(int i = 0; i < n; i++){
        //cout << down[i] << ' ' << up[n - i - 1] << endl;
        ans += min(down[i], up[i]);
    }
    
    cout << ans << endl;
    
    return 0;
}
/*
 3 1
 3 4 5
 1 2 90
 
 */

Compilation message

colouring.cpp: In function 'int main()':
colouring.cpp:27:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i = 0; i < down.size(); i++)
      |                    ~~^~~~~~~~~~~~~
colouring.cpp:30:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i = 0; i < up.size(); i++)
      |                    ~~^~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 148 ms 3412 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 314 ms 6560 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -