1749A - Cowardly Rooks - CodeForces Solution

implementation

Please click on ads to support us..

Python Code: 

def solve1():
    n,m=list(map(int,input().split(" ")))
    l1=[]
    l2=[]
    for i in range(m):
        x,y=list(map(int,input().split(" ")))
        l1.append(x)
        l2.append(y)

    for i in range(1,n+1):
        for j in range(1,n+1):
            if i not in l1 and j not in l1:
                print("YES")
                return 
    
    print("NO")
    return ;


for i in range(int(input())):
    solve1()

C++ Code: 

#include <bits/stdc++.h>
#define int long long
#define pb push_back
using namespace std;
void fast()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output_new.txt", "w", stdout);
#endif
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
} 
void solve()
{
    int n,m;
    cin>>n>>m;
    vector<int>temp;
    for(int i=0;i<m;i++){
        int x,y;
        cin>>x>>y;
    }
    if(m==n)cout<<"NO"<<endl;
    else cout<<"YES"<<endl;
}
main()
{
    fast();
    int t;
    cin >> t;
    while (t--)
    solve();
}


Comments

Submit
0 Comments
More Questions

1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines
328. Odd Even Linked List
1219. Path with Maximum Gold