oj.uz

Submission #946574

# Submission time Handle Problem Language Result Execution time Memory
946574 2024-03-14T18:56:16 Z simona1230 Fireworks (APIO16_fireworks) C++17
7 / 100
 2 ms 5156 KB 
#include <bits/stdc++.h>

using namespace std;
int n,m;
vector<pair<int,int> > v[200001];
vector<int> val;
void read()
{
    cin>>n>>m;
    for(int i=2;i<=n+m;i++)
    {
        int x,y;
        cin>>x>>y;
        val.push_back(y);
        v[i].push_back({x,y});
    }

    if(n==1)
    {
        sort(val.begin(),val.end());
        int sz=val.size();
        long long need=val[sz/2],ans=0;
        for(int i=0;i<sz;i++)
            ans+=abs(val[i]-need);
        cout<<ans<<endl;
        exit(0);
    }
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	read();
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5156 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 2 ms 5156 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct

Subtask #2
0 / 19.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5156 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 2 ms 5156 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Incorrect 1 ms 4956 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5156 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 2 ms 5156 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Incorrect 1 ms 4956 KB Output isn't correct
12 Halted 0 ms 0 KB -