oj.uz

Submission #660879

# Submission time Handle Problem Language Result Execution time Memory
660879 2022-11-23T12:42:30 Z danikoynov Palembang Bridges (APIO15_bridge) C++14
22 / 100
 102 ms 4976 KB 
#include <bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 1e5 + 10;

struct work
{
    ll x, y;
}w[maxn];

int k, n;
void solve()
{
    cin >> k >> n;
    ll ans = 0;
    vector < ll > v;
    for (int i = 1; i <= n; i ++)
    {
        char c1, c2;
        cin >> c1 >> w[i].x >> c2 >> w[i].y;
              if (w[i].x > w[i].y)
            swap(w[i].x, w[i].y);
        if (c1 == c2)
        {
            ans = ans + w[i].y - w[i].x;
        }
        else
        {
            v.push_back(w[i].y);
            v.push_back(w[i].x);
            ans ++;
        }
    }

    sort(v.begin(), v.end());
    for (int i = 0; i < v.size() / 2; i ++)
        ans = ans - (v[i]);
        for (int i = v.size() / 2; i < v.size(); i ++)
            ans = ans + v[i];

        cout << ans << endl;


}

int main()
{
    solve();
    return 0;
}

Compilation message

bridge.cpp: In function 'void solve()':
bridge.cpp:46:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for (int i = 0; i < v.size() / 2; i ++)
      |                     ~~^~~~~~~~~~~~~~
bridge.cpp:46:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   46 |     for (int i = 0; i < v.size() / 2; i ++)
      |     ^~~
bridge.cpp:48:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   48 |         for (int i = v.size() / 2; i < v.size(); i ++)
      |         ^~~
bridge.cpp:48:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for (int i = v.size() / 2; i < v.size(); i ++)
      |                                    ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 272 KB Output is correct
5 Correct 2 ms 320 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 2 ms 320 KB Output is correct
8 Correct 1 ms 316 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 2 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 46 ms 4300 KB Output is correct
13 Correct 102 ms 4704 KB Output is correct
14 Correct 65 ms 4644 KB Output is correct
15 Correct 61 ms 3652 KB Output is correct
16 Correct 72 ms 4804 KB Output is correct
17 Correct 90 ms 4796 KB Output is correct
18 Correct 82 ms 4740 KB Output is correct
19 Correct 100 ms 4752 KB Output is correct
20 Correct 83 ms 4976 KB Output is correct
21 Correct 89 ms 4820 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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