oj.uz

Submission #391348

# Submission time Handle Problem Language Result Execution time Memory
391348 2021-04-18T15:43:13 Z arwaeystoamneg Dancing Elephants (IOI11_elephants) C++17
26 / 100
 9000 ms 5184 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}

#ifndef arwaeystoamneg
#include "elephants.h"
#endif

const int MAX = 150005;
int n, a[MAX], l;
map<int, int>cur;
void init(int N, int L, int X[])
{
	n = N;
	l = L;
	F0R(i, n)a[i] = X[i];
	F0R(i, n)cur[a[i]]++;
}
int query()
{
	auto it = cur.begin();
	int ans = 0, last = -inf;
	while (it != cur.end())
	{
		if (it->f - last > l)
		{
			ans++;
			last = it->f;
		}
		it++;
	}
	return ans;
}
int update(int i, int y)
{
	cur[a[i]]--;
	if (cur[a[i]] == 0)cur.erase(a[i]);
	a[i] = y;
	cur[a[i]]++;
	return query();
}


#ifdef arwaeystoamneg
#define MAX_N 1000000
#define MAX_M 1000000

static int N, L, M;
static int X[MAX_N];
static int ii[MAX_M];
static int yy[MAX_M];
static int sol[MAX_M];

inline
void my_assert(int e) { if (!e) abort(); }

void read_input()
{
	int i;
	my_assert(3 == scanf("%d %d %d", &N, &L, &M));
	for (i = 0; i < N; i++)
		my_assert(1 == scanf("%d", &X[i]));
	for (i = 0; i < M; i++)
		my_assert(3 == scanf("%d %d %d", &ii[i], &yy[i], &sol[i]));
}

int main()
{
	setIO("test1");
	int i, ans;

	read_input();
	init(N, L, X);
	for (i = 0; i < M; i++) {
		ans = update(ii[i], yy[i]);
		if (ans == sol[i])continue;
		printf("Incorrect.  In %d-th move, answered %d (%d expected).\n",
			i + 1, ans, sol[i]);
		return 0;
	}
	printf("Correct.\n");
	return 0;
}


#endif

Compilation message

elephants.cpp: In function 'void setIO(std::string)':
elephants.cpp:48:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
elephants.cpp:50:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 312 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 6115 ms 2484 KB Output is correct
8 Correct 8837 ms 2868 KB Output is correct
9 Execution timed out 9087 ms 5184 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 6115 ms 2484 KB Output is correct
8 Correct 8837 ms 2868 KB Output is correct
9 Execution timed out 9087 ms 5184 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 6115 ms 2484 KB Output is correct
8 Correct 8837 ms 2868 KB Output is correct
9 Execution timed out 9087 ms 5184 KB Time limit exceeded
10 Halted 0 ms 0 KB -