oj.uz

Submission #643837

# Submission time Handle Problem Language Result Execution time Memory
643837 2022-09-23T05:10:45 Z ghostwriter Sorting (IOI15_sorting) C++14
0 / 100
 1 ms 324 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    VOI23 gold medal
*/
namespace subtask1234 {
	const int N = 500;
	int pos[N], S1[N];
	bool sorted(int N, int S[]) {
		bool sorted = 1;
		FOR(i, 1, N - 1)
			if (S[i] < S[i - 1])
				sorted = 0;
		return sorted;
	}
	int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
		FOR(i, 0, N - 1) {
			S1[i] = S[i];
			pos[i] = i;
		}
		FOS(i, M - 1, 0) {
			int x = X[i], y = Y[i];
			swap(pos[x], pos[y]);
		}
		if (sorted(N, S1)) return 0;
		FOR(i, 0, N - 2) {
			if (sorted(N, S1)) return i + 1;
			int x = X[i], y = Y[i], cur = -1, npos = -1;
			FOR(j, 0, N - 1)
				if (S1[j] == i)
					cur = j;
			FOR(j, 0, N - 1)
				if (pos[j] == i)
					npos = j;
			P[i] = cur;
			Q[i] = npos;
			swap(S1[cur], S1[npos]);
			if (sorted(N, S1)) return i + 2;
			swap(S1[x], S1[y]);
			swap(pos[x], pos[y]);
		}
		FOR(i, N - 1, M - 1) {
			if (sorted(N, S1)) return i + 1;
			int x = X[i], y = Y[i];
			P[i] = Q[i] = 0;
			swap(S1[x], S1[y]);
			if (sorted(N, S1)) return i + 2;
		}
		return M;
	}
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	if (N <= 500 && M >= N) return subtask1234::findSwapPairs(N, S, M, X, Y, P, Q);
	return 1;
}
/*
*/
/*
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

sorting.cpp: In function 'bool subtask1234::sorted(int, int*)':
sorting.cpp:46:18: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   46 |  bool sorted(int N, int S[]) {
      |              ~~~~^
sorting.cpp:44:12: note: shadowed declaration is here
   44 |  const int N = 500;
      |            ^
sorting.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sorting.cpp:48:3: note: in expansion of macro 'FOR'
   48 |   FOR(i, 1, N - 1)
      |   ^~~
sorting.cpp: In function 'int subtask1234::findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:53:24: warning: declaration of 'N' shadows a global declaration [-Wshadow]
   53 |  int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                    ~~~~^
sorting.cpp:44:12: note: shadowed declaration is here
   44 |  const int N = 500;
      |            ^
sorting.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sorting.cpp:54:3: note: in expansion of macro 'FOR'
   54 |   FOR(i, 0, N - 1) {
      |   ^~~
sorting.cpp:33:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   33 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
sorting.cpp:58:3: note: in expansion of macro 'FOS'
   58 |   FOS(i, M - 1, 0) {
      |   ^~~
sorting.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sorting.cpp:63:3: note: in expansion of macro 'FOR'
   63 |   FOR(i, 0, N - 2) {
      |   ^~~
sorting.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sorting.cpp:66:4: note: in expansion of macro 'FOR'
   66 |    FOR(j, 0, N - 1)
      |    ^~~
sorting.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sorting.cpp:69:4: note: in expansion of macro 'FOR'
   69 |    FOR(j, 0, N - 1)
      |    ^~~
sorting.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sorting.cpp:79:3: note: in expansion of macro 'FOR'
   79 |   FOR(i, N - 1, M - 1) {
      |   ^~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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