oj.uz

Submission #870280

# Submission time Handle Problem Language Result Execution time Memory
870280 2023-11-07T12:04:29 Z KiaRez Arranging Tickets (JOI17_arranging_tickets) C++17
0 / 100
 1 ms 2512 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

int n, m, a[N], b[N], c[N], wh[N], res[N];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n>>m;
	for(int i=1; i<=m; i++) {
		cin>>a[i]>>b[i]>>c[i];
		if(a[i] > b[i]) swap(a[i], b[i]);
		for(int j=a[i]; j<b[i]; j++) res[j] ++;
	}

	while(true) {
		int cnd = 0, maxi = 0, cnt = 0;
		for(int i=1; i<=n; i++) maxi = max(maxi, res[i]);
		for(int i=1; i<=n; i++) cnt += (maxi==res[i]);
		for(int i=1; i<=m; i++) {
			if(wh[i] == 0) {
				int cntmx=0, cntmx2=0;
				for(int j=a[i]; j<b[i]; j++) {
					cntmx += (res[j] == maxi);
				}
				for(int j=1; j<a[i]; j++) {
					cntmx2 += (res[j] == maxi-1);
				}
				for(int j=b[i]; j<=n; j++) {
					cntmx2 += (res[j] == maxi-1);
				}
				if(cntmx2==0 && cntmx==cnt) {
					cnd = i;
				}
			} else {
				int cntmx=0, cntmx2=0;
				for(int j=a[i]; j<b[i]; j++) {
					cntmx2 += (res[j] == maxi-1);
				}
				for(int j=1; j<a[i]; j++) {
					cntmx += (res[j] == maxi);
				}
				for(int j=b[i]; j<=n; j++) {
					cntmx += (res[j] == maxi);
				}
				if(cntmx2==0 && cntmx==cnt) {
					cnd = i;
				}
			}
		}
		if(cnd == 0) kill(maxi);
		if(wh[cnd] == 0) {
			for(int j=a[cnd]; j<b[cnd]; j++) {
				res[j] -= 1;
			}
			for(int j=1; j<a[cnd]; j++) {
				res[j] += 1;
			}
			for(int j=b[cnd]; j<=n; j++) {
				res[j] += 1;
			}
		} else {
			for(int j=a[cnd]; j<b[cnd]; j++) {
				res[j] += 1;
			}
			for(int j=1; j<a[cnd]; j++) {
				res[j] -= 1;
			}
			for(int j=b[cnd]; j<=n; j++) {
				res[j] -= 1;
			}
		}
		wh[cnd]^=1;
	}

	return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 35.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 15.0

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