oj.uz

답안 #624226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
624226 2022-08-07T13:38:37 Z IWTIM Checker (COCI19_checker) C++14
23 / 110
 254 ms 45880 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;
}*/
#define pii pair <int, int>
#define pb push_back
const int N = 3e5 + 5;
int t,n,a[N], col[N];
vector < pii > v[N];
vector <int> v1[N],v2[N];
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;
    	col[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,c});
		v[b].pb({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);
	}
	cout<<"tocno\n";
}

Compilation message

checker.cpp:110:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  110 | main() {
      | ^~~~
checker.cpp: In function 'int main()':
checker.cpp:130:12: warning: unused variable 'x' [-Wunused-variable]
  130 |   for (int x : v2[i]) {
      |            ^

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21460 KB Output is correct
2 Correct 13 ms 21472 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 10 ms 21408 KB Output is correct
5 Incorrect 10 ms 21460 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21460 KB Output is correct
2 Correct 13 ms 21472 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 10 ms 21408 KB Output is correct
5 Incorrect 10 ms 21460 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 214 ms 38372 KB Output is correct
2 Correct 250 ms 38408 KB Output is correct
3 Correct 195 ms 38336 KB Output is correct
4 Correct 187 ms 38324 KB Output is correct
5 Correct 218 ms 38400 KB Output is correct
6 Correct 196 ms 44996 KB Output is correct
7 Correct 200 ms 45880 KB Output is correct
8 Correct 146 ms 40256 KB Output is correct
9 Correct 144 ms 40412 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 247 ms 38580 KB Output is correct
2 Correct 228 ms 38524 KB Output is correct
3 Incorrect 254 ms 38492 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 21460 KB Output is correct
2 Correct 13 ms 21472 KB Output is correct
3 Correct 11 ms 21460 KB Output is correct
4 Correct 10 ms 21408 KB Output is correct
5 Incorrect 10 ms 21460 KB Output isn't correct
6 Halted 0 ms 0 KB -