oj.uz

Submission #624237

# Submission time Handle Problem Language Result Execution time Memory
624237 2022-08-07T13:52:34 Z IWTIM Checker (COCI19_checker) C++14
110 / 110
 1463 ms 124024 KB 
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#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 rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#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 rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;

/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
#define pii pair <int, int>
#define pb push_back
const int N = 3e5 + 5, B = 400;
int t,n,a[N];
vector <int> v[N],v1[N],v2[N];
map < pii , int> col;
multiset <int> s;
int get(char ch) {
    return (int)(ch - '0');
}
main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int subtask;
    cin>>subtask;
    cin>>n;
    for (int i = 1; i <= n; i++) {
    	char ch;
    	cin>>ch;
    	if (i != n)
    	col[{i, i + 1}] = get(ch), col[{i + 1, i}] = get(ch);
    	else col[{i, 1}] = get(ch), col[{1, i}] = get(ch);
	}
	for (int i = 1; i <= n - 3; i++){
		int a, b,c;
		cin>>a>>b>>c;
		if (a > b) swap(a,b);
		v1[a].pb(b);
		v2[b].pb(a);	
		v[a].pb(b);
		v[b].pb(a);
		col[{a,b}] = col[{b,a}] = c;
	}
	for (int i = 1; i <= n; i++) {
		for (int x : v2[i]) {
			s.erase(s.find(i));
		}
		if (v1[i].size() && s.size()) {
		    for (int x : v1[i]) {
		        if (x > *s.begin()) {
		            cout<<"neispravna triangulacija\n";
			        exit(0);
		        }
		    }
			
		}
		for (int x : v1[i]) s.insert(x);
	}
	for (int i = 1; i <= n - 1;i++) {
		v[i].pb(i + 1);
		v[i - 1].pb(i);
	}
	vector <int> heavy;
	v[n].pb(1);
	v[1].pb(n);
	vector <int> hv(n + 5, 0);
	for (int i = 1; i <= n; i++) {
		if (v[i].size() >= B) {
			heavy.pb(i);
			hv[i] = 1;
		}
	}
	int ff = 0;
	for (int i = 1; i <= n; i++) {
		if (!hv[i]) {
			for (int j = 0; j < v[i].size(); j++) {
				for (int k = j + 1; k < v[i].size(); k++) {
					int a = i; int b = v[i][j]; int c = v[i][k];
					if (a == b || b == c || a == c) continue;
					if (!col[{a,b}] || !col[{b,c}] || !col[{a,c}]) continue;
					if (col[{a,b}] + col[{b,c}] + col[{a,c}] != 6) ff = 1;
				}
			}
			continue;
		}
		int a = i;
		for (int b : heavy) {
		    for (int c : heavy) {
		        if (b == c || b > c || a == c || a == b) continue;
		        if (!col[{a,b}] || !col[{b,c}] || !col[{a,c}]) continue;
				if (col[{a,b}] + col[{b,c}] + col[{a,c}] != 6) ff = 1;
		        
		    }
		}
	}
	cout<<(ff == 1 ? "neispravno bojenje" : "tocno");
}

Compilation message

checker.cpp:191:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  191 | main() {
      | ^~~~
checker.cpp: In function 'int main()':
checker.cpp:214:12: warning: unused variable 'x' [-Wunused-variable]
  214 |   for (int x : v2[i]) {
      |            ^
checker.cpp:245:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  245 |    for (int j = 0; j < v[i].size(); j++) {
      |                    ~~^~~~~~~~~~~~~
checker.cpp:246:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  246 |     for (int k = j + 1; k < v[i].size(); k++) {
      |                         ~~^~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21460 KB Output is correct
2 Correct 11 ms 21460 KB Output is correct
3 Correct 12 ms 21460 KB Output is correct
4 Correct 10 ms 21460 KB Output is correct
5 Correct 11 ms 21480 KB Output is correct
6 Correct 10 ms 21480 KB Output is correct
7 Correct 11 ms 21476 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21460 KB Output is correct
2 Correct 11 ms 21460 KB Output is correct
3 Correct 12 ms 21460 KB Output is correct
4 Correct 10 ms 21460 KB Output is correct
5 Correct 11 ms 21480 KB Output is correct
6 Correct 10 ms 21480 KB Output is correct
7 Correct 11 ms 21476 KB Output is correct
8 Correct 17 ms 22380 KB Output is correct
9 Correct 17 ms 22484 KB Output is correct
10 Correct 13 ms 22016 KB Output is correct
11 Correct 14 ms 22000 KB Output is correct
12 Correct 17 ms 22484 KB Output is correct
13 Correct 17 ms 22376 KB Output is correct
14 Correct 16 ms 22384 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1460 ms 120756 KB Output is correct
2 Correct 1424 ms 120816 KB Output is correct
3 Correct 691 ms 83212 KB Output is correct
4 Correct 692 ms 83212 KB Output is correct
5 Correct 682 ms 83276 KB Output is correct
6 Correct 1108 ms 90400 KB Output is correct
7 Correct 1082 ms 91232 KB Output is correct
8 Correct 790 ms 85764 KB Output is correct
9 Correct 760 ms 85800 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1446 ms 120604 KB Output is correct
2 Correct 1428 ms 120564 KB Output is correct
3 Correct 1434 ms 120768 KB Output is correct
4 Correct 1463 ms 123592 KB Output is correct
5 Correct 1457 ms 123692 KB Output is correct
6 Correct 1105 ms 96992 KB Output is correct
7 Correct 1105 ms 96192 KB Output is correct
8 Correct 1132 ms 94372 KB Output is correct
9 Correct 1103 ms 94252 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21460 KB Output is correct
2 Correct 11 ms 21460 KB Output is correct
3 Correct 12 ms 21460 KB Output is correct
4 Correct 10 ms 21460 KB Output is correct
5 Correct 11 ms 21480 KB Output is correct
6 Correct 10 ms 21480 KB Output is correct
7 Correct 11 ms 21476 KB Output is correct
8 Correct 17 ms 22380 KB Output is correct
9 Correct 17 ms 22484 KB Output is correct
10 Correct 13 ms 22016 KB Output is correct
11 Correct 14 ms 22000 KB Output is correct
12 Correct 17 ms 22484 KB Output is correct
13 Correct 17 ms 22376 KB Output is correct
14 Correct 16 ms 22384 KB Output is correct
15 Correct 1460 ms 120756 KB Output is correct
16 Correct 1424 ms 120816 KB Output is correct
17 Correct 691 ms 83212 KB Output is correct
18 Correct 692 ms 83212 KB Output is correct
19 Correct 682 ms 83276 KB Output is correct
20 Correct 1108 ms 90400 KB Output is correct
21 Correct 1082 ms 91232 KB Output is correct
22 Correct 790 ms 85764 KB Output is correct
23 Correct 760 ms 85800 KB Output is correct
24 Correct 1446 ms 120604 KB Output is correct
25 Correct 1428 ms 120564 KB Output is correct
26 Correct 1434 ms 120768 KB Output is correct
27 Correct 1463 ms 123592 KB Output is correct
28 Correct 1457 ms 123692 KB Output is correct
29 Correct 1105 ms 96992 KB Output is correct
30 Correct 1105 ms 96192 KB Output is correct
31 Correct 1132 ms 94372 KB Output is correct
32 Correct 1103 ms 94252 KB Output is correct
33 Correct 1460 ms 123876 KB Output is correct
34 Correct 1447 ms 123688 KB Output is correct
35 Correct 709 ms 86368 KB Output is correct
36 Correct 737 ms 86320 KB Output is correct
37 Correct 1426 ms 124024 KB Output is correct
38 Correct 1425 ms 123744 KB Output is correct
39 Correct 1413 ms 123820 KB Output is correct
40 Correct 1108 ms 93968 KB Output is correct
41 Correct 1119 ms 96912 KB Output is correct
42 Correct 751 ms 89388 KB Output is correct
43 Correct 1096 ms 94664 KB Output is correct