oj.uz

Submission #222394

# Submission time Handle Problem Language Result Execution time Memory
222394 2020-04-13T06:26:31 Z oolimry Checker (COCI19_checker) C++14
23 / 110
 138 ms 6900 KB 
    #include <bits/stdc++.h>
     
    using namespace std;
    typedef pair<int,int> ii;
    struct bracket{
    	int pos; int other; bool open;
    };
    bool comp(bracket a, bracket b){
    	if(a.pos != b.pos) return a.pos < b.pos;
    	
    	if(a.open && !b.open) return false;
    	if(!a.open && b.open) return true;
    	
    	if(a.open){
    		return a.other > b.other;
    	}
    	else{
    		return a.other > b.other;
    	}
    }
     
    void notTriangle(){
    	cout << "neispravna triangulacija";
    	exit(0);
    }
     
    int main(){
    	//freopen("i.txt","r",stdin);
    	ios_base::sync_with_stdio(false);
    	int ST; cin >> ST;
    	
    	int n; cin >> n;
    	string S; cin >> S;
    	
    	vector<bracket> B;
    	for(int i = 0;i < n-3;i++){
    		int l, r, c; cin >> l >> r >> c;
    		if(l > r) swap(l,r);
    		B.push_back({l,r,true});
    		B.push_back({r,l,false});
    	}
    	
    	sort(B.begin(),B.end(),comp);
    	
    	
    	stack<ii> s;
    	for(bracket b : B){
    		//cout << b.pos << " " << b.other << " " << b.open << endl;
    		if(b.open) s.push(ii(b.pos,b.other));
    		else{
    			ii t = s.top();
    			if(t.first != b.other && t.second != b.pos){
    				notTriangle();
    			}
    			else s.pop();
    		}
    	}
    	
    	
    	
    	
    	
    	cout << "tocno";
    	
    }

Subtask #1
0 / 12.0

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

Subtask #2
0 / 17.0

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

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 6772 KB Output is correct
2 Correct 135 ms 6772 KB Output is correct
3 Correct 135 ms 6768 KB Output is correct
4 Correct 135 ms 6772 KB Output is correct
5 Correct 132 ms 6776 KB Output is correct
6 Correct 138 ms 6848 KB Output is correct
7 Correct 134 ms 6900 KB Output is correct
8 Correct 131 ms 6772 KB Output is correct
9 Correct 133 ms 6776 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 6900 KB Output is correct
2 Correct 128 ms 6772 KB Output is correct
3 Incorrect 127 ms 6772 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

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