# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930380 | vjudge1 | Towers (NOI22_towers) | C++17 | 2041 ms | 9000 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/******************************************************************************
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;
int ans=0;
int mx = 0;
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].second]>=3){can=false;break;}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |