oj.uz

답안 #930372

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930372 2024-02-19T13:30:46 Z vjudge1 Towers (NOI22_towers) C++17
0 / 100
 2000 ms 20552 KB 
/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    pair<int,int> arr[n];
    map<int,int> x;
    map<int,int> y;
    for(int i = 0;i<n;i++)cin>>arr[i].first>>arr[i].second;
    for(int mask = 1;mask< (1<<n);mask++){
        for(int i = 0;i<n;i++){x[arr[i].first]=0;y[arr[i].second]=0;}
        int cnt = 0;
        bool can = true;
        for(int i = 0;i<n;i++){
            if(!((1<<i)&mask))continue;
            cnt++;
            x[arr[i].first]++;
            y[arr[i].second]++;
            if(x[arr[i].first]==3||y[arr[i].first]==3){can=false;break;}
        }
        can&=(cnt>=2);
        if(can){
            for(int i = 0;i<n;i++){
                if(!((1<<i)&mask))cout<<0;
                else{
                    cout<<1;
                }
            }
            return 0;
        }
    }
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 424 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 424 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2009 ms 1624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 401 ms 20552 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 424 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 424 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 424 KB Output isn't correct
4 Halted 0 ms 0 KB -