-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
109 lines (91 loc) · 2.03 KB
/
C.cpp
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < b; i++)
#define repR(i, a, b) for(int i = a; i >= b; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD1 1000000007
#define MOD2 998244353
#define INF 2000000000000000000
#define ps(x,y) fixed << setprecision(y) << x
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//member functions :
//1. order_of_key(k) : number of elements strictly lesser than k
//2. find_by_order(k) : k-th element in the set
void solve()
{
int k;
cin >> k;
vector<ll> adj[k], p(k, 0LL);
rep(i, 0, k) {
int n;
cin >> n;
rep(j, 0, n) {
ll x;
cin >> x;
adj[i].pb(x);
p[i] += x;
}
}
map<ll, set<int>> m;
rep(i, 0, k) {
for (auto x : adj[i]) {
m[p[i] - x].insert(i);
}
}
for (auto it : m) {
if (sz(it.ss) >= 2) {
cout << "YES\n";
set<int> s = it.ss;
int i, j, x, y;
i = *s.begin();
s.erase(s.begin());
j = *s.begin();
ll sum = it.ff;
rep(l, 0, sz(adj[i])) {
if (p[i] - adj[i][l] == sum) {
x = l;
break;
}
}
rep(l, 0, sz(adj[j])) {
if (p[j] - adj[j][l] == sum) {
y = l;
break;
}
}
cout << i + 1 << ' ' << x + 1 << '\n';
cout << j + 1 << ' ' << y + 1 << '\n';
return;
}
}
cout << "NO\n";
}
int main()
{
fastio;
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
}