oj.uz

Submission #335156

# Submission time Handle Problem Language Result Execution time Memory
335156 2020-12-11T10:01:00 Z VodkaInTheJar Fortune Telling 2 (JOI14_fortune_telling2) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define endl '\n'

using namespace std;

const int maxn = 2e5 + 3; 

int n, k; 
int a[maxn], b[maxn], t[maxn];
void read()
{
	cin >> n >> k;
	for (int i = 1; i <= n; i++)
	cin >> a[i] >> b[i];
	
	for (int i = 1; i <= k; i++)
	cin >> t[i];
}

void solve()
{
	long long ans = 0;
	for (int i = 1; i <= n; i++)
	{
		vector <int> v; 
		for (int j = 1; j <= k; j++)
		{
			if (t[j] >= max(a[i], b[i]))
			v.push_back(1);
			
			else 
			if (t[j] >= min(a[i], b[i]))
			v.push_back(2);
		}
		
		int diff = 1;
	    for (int j = 0; j < (int)v.size()-1; j++)
	    if (v[j] != v[j+1])
	    diff++;
	    
	    int cnt = 0;
	    for (auto j: v)
	    {
			if (j == 2)
			break;
			
			cnt++;
		}
		
		int first;
		if (cnt % 2 == 0)
		{
			if (cnt != 0)
			diff--;
			
			first = 2;
		}
		
		else 
		first = 1; 
		
		int temp;
		if (a[i] >= b[i])
		{
			if (first == 1)
			temp = diff;
			
			else 
			temp = diff + 1; 
		}
		
		else 
		{
			if (first == 2)
			temp = diff;
			
			else 
			temp = max(1, diff - 1);
		}
		
	//	cout << i << " " << temp << endl; 
		if (temp & 1)
		ans += b[i];
		
		else
		ans += a[i];
	}
	
	cout << ans << endl; 
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	read();
	solve();
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 31.0

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

Subtask #3
0 / 65.0

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