제출 #757968

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
757968	2023-06-14 03:15:03	Adrian_Soriaga	Towers (NOI22_towers)	C++14	5 / 100	1 ms	436 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    int a,b,n,x,y; cin>>n;
    vector<vector<int>> towers(3);
    for (int i=0;i<n;i++){
        cin>>a>>b; towers[i].push_back(a);towers[i].push_back(b); 
    }
    if (n==1){
        cout<<"1";
    }
    else if (n==2){
        cout<<"11";
    }
    else{
    vector<string> ans= {"0","0","0"};
    string s= "";
        if (towers[0][0] == towers[1][0] && towers[2][0] == towers[1][0]){
            x = max(towers[0][1], max(towers[1][1],towers[2][1])); y = min(towers[0][1], min(towers[1][1],towers[2][1]));             for (int i =0; i<3;i++){
            if (towers[i][1] == x) {ans[i] = "1";} if (towers[i][1] == y) {ans[i] = "1";}
            }
            for (int i =0;i<3;i++){s+=ans[i];} cout<<s;
        }
        else if (towers[0][1] == towers[1][1] && towers[2][1] == towers[1][1]){
            x = max(towers[0][0], max(towers[1][0],towers[2][0])); y = min(towers[0][0], min(towers[1][0],towers[2][0])); 
            for (int i =0; i<3;i++){
            if (towers[i][0] == x) {ans[i] = "1";} if (towers[i][0] == y){ans[i] = "1";}
            }
            for (int i =0;i<3;i++){s+=ans[i];} cout<<s;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 7
• Subtask 4: 0 / 6
• Subtask 5: 0 / 31
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19