oj.uz

답안 #1054761

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1054761 2024-08-12T11:58:59 Z KebabuVaikis15 Palembang Bridges (APIO15_bridge) C++14
22 / 100
 83 ms 10204 KB 
///Gyvenimas grazus
#include <bits/stdc++.h>
using namespace std;

const int MAXN=100000;
long long k, n, pradSuma=0, suma=0;
char a[MAXN], b[MAXN];
long long x[MAXN], y[MAXN];

vector<tuple<long long, long long>> keliai;
long long dPtr=0;
long long dKairej=0, dDesinej;

vector<pair<long long, long long>> pertiltinesPoros;

long long skaiciuok(long long pos1, long long pos2)
{
    long long val=0;
    for (auto i:pertiltinesPoros)
    {
        if ((i.first<=pos1 && pos1<=i.second) ||
            (i.first<=pos2 && pos2<=i.second))
            continue;
        val+=2ll*min(min(abs(i.first-pos1), abs(i.second-pos1)), min(abs(i.first-pos2), abs(i.second-pos2)));
    }
    return val;
}

void tinkintDesine(long long id1, long long id2)
{
    while (dKairej<dDesinej)
    {
        long long pradPos=get<0>(keliai[dPtr]);
        dPtr++;
        suma-=2ll*(get<0>(keliai[dPtr])-pradPos)*(dDesinej-dKairej);
        if (get<1>(keliai[dPtr])==0)
            dDesinej--;
        else
            dKairej++;
    }
}

int main()
{
    cin>>k>>n;
    for (int i=0; i<n; i++)
    {
        cin>>a[i]>>x[i]>>b[i]>>y[i];
        if (x[i]>y[i])
                swap(x[i], y[i]);
        pradSuma+=y[i]-x[i];
        if (a[i]!=b[i])
        {
            pradSuma++;
            keliai.push_back(make_tuple(x[i], 0));
            keliai.push_back(make_tuple(y[i], 1));
            pertiltinesPoros.push_back({x[i], y[i]});
        }
    }
    keliai.push_back(make_tuple(0, 0));
    sort(keliai.begin(), keliai.end());
    for (int i=0; i<n; i++)
        if (a[i]!=b[i])
            suma+=2ll*x[i];
    dDesinej=keliai.size()/2;
    tinkintDesine(-1, -1);
    if (k==1)
    {
        cout<<pradSuma+suma<<endl;
        return 0;
    }
    long long ats=LONG_MAX;
    for (int i=1; i<keliai.size(); i++)
        for (int j=i; j<keliai.size(); j++)
            ats=min(ats, pradSuma+skaiciuok(get<0>(keliai[i]), get<0>(keliai[j])));
    cout<<ats;
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:73:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for (int i=1; i<keliai.size(); i++)
      |                   ~^~~~~~~~~~~~~~
bridge.cpp:74:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for (int j=i; j<keliai.size(); j++)
      |                       ~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 540 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 29 ms 8804 KB Output is correct
13 Correct 58 ms 8892 KB Output is correct
14 Correct 67 ms 9380 KB Output is correct
15 Correct 39 ms 5060 KB Output is correct
16 Correct 47 ms 9560 KB Output is correct
17 Correct 83 ms 10072 KB Output is correct
18 Correct 51 ms 10204 KB Output is correct
19 Correct 63 ms 8740 KB Output is correct
20 Correct 62 ms 8900 KB Output is correct
21 Correct 80 ms 8944 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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