oj.uz

Submission #1054183

# Submission time Handle Problem Language Result Execution time Memory
1054183 2024-08-12T07:21:43 Z FaustasK Palembang Bridges (APIO15_bridge) C++14
22 / 100
 29 ms 3412 KB 
#include <bits/stdc++.h>

using namespace std;

struct gyventojas
{
    char p;
    int s;
    char q;
    int t;
};

const int maxn = 100000;

int k, n;
gyventojas M[maxn];

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> k >> n;
    long long A_puse = 0;
    long long B_puse = 0;
    vector <int> reikalingi;
    vector <int> nereikalingi;
    vector <int> medianai;
    for(int i = 0; i<n; i++)
    {
        cin >> M[i].p >> M[i].s >> M[i].q >> M[i].t;
        if(M[i].p != M[i].q)
        {
            reikalingi.push_back(i);
            medianai.push_back(M[i].s);
            medianai.push_back(M[i].t);
            if(M[i].p == 'A' && M[i].q == 'B')
            {
                A_puse += M[i].s;
                B_puse += M[i].t;
            }
            else
            {
                A_puse += M[i].t;
                B_puse += M[i].s;
            }
        }
        else nereikalingi.push_back(i);
    }
    int kiek = reikalingi.size();
    long long ats = 0;
    if(kiek>0)
    {
        /*long long suma = A_puse + B_puse;
        double liekana1 = suma%2;
        //cout << liekana1 << endl;
        liekana1/=2;
        suma/=2;
        //cout << suma << endl;
        //cout << liekana1 << endl;
        double liekana2 = suma%kiek;
        //cout << liekana2 << endl;
        liekana2 += liekana1;
        //cout << liekana2 << endl;
        liekana2/=kiek;
        //cout << liekana2 << endl;
        suma/=kiek;
        //cout << suma << endl;
        double dsuma = suma + liekana2;
        //cout << dsuma << endl;
        int tiltas = round(dsuma);
        //cout << ats;*/
        sort(medianai.begin(), medianai.end());
        int tiltas = medianai[medianai.size()/2];
        for(int i = 0; i<reikalingi.size(); i++)
        {
            int j = reikalingi[i];
            ats += abs(M[j].s - tiltas) + abs(M[j].t - tiltas);
        }
    }
    for(int i = 0; i<nereikalingi.size(); i++)
    {
        int j = nereikalingi[i];
        ats += abs(M[j].s - M[j].t);
    }
    cout << ats + reikalingi.size();
    return 0;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:73:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |         for(int i = 0; i<reikalingi.size(); i++)
      |                        ~^~~~~~~~~~~~~~~~~~
bridge.cpp:79:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for(int i = 0; i<nereikalingi.size(); i++)
      |                    ~^~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 11 ms 3412 KB Output is correct
13 Correct 29 ms 3232 KB Output is correct
14 Correct 17 ms 3020 KB Output is correct
15 Correct 14 ms 2312 KB Output is correct
16 Correct 13 ms 3384 KB Output is correct
17 Correct 16 ms 3276 KB Output is correct
18 Correct 23 ms 3248 KB Output is correct
19 Correct 24 ms 3272 KB Output is correct
20 Correct 15 ms 3272 KB Output is correct
21 Correct 22 ms 3276 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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