QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #136595 | #237. Triangle Partition | nameless_story# | 100 ✓ | 8ms | 3496kb | C++20 | 454b | 2023-08-09 09:13:40 | 2023-08-09 09:13:59 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n; cin>>n;
vector<pair<int,int>> a(n*3);
for (auto &[x,y]:a){
cin>>x>>y;
}
vector<int> p(n*3);
iota(p.begin(),p.end(),0);
sort(p.begin(),p.end(),[&](int x,int y){return a[x]<a[y];});
for (int i:p) cout<<i+1<<' ';
cout<<'\n';
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int T; cin>>T;
while (T--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 8ms
memory: 3496kb
input:
190 10 -7215 2904 -5179 1663 -542 1091 -5687 7868 7838 -1048 -2944 4346 -2780 3959 -9402 1099 -8548 -7238 -3821 -2917 2713 295 -856 -8661 7651 3945 -8216 -543 5798 5024 8583 -3384 -1208 5955 3068 -385 340 2968 6559 -272 4537 5075 5126 4343 639 8281 1700 2572 819 9317 -9854 -1316 -3421 -1137 9368 718...
output:
26 8 9 14 29 1 4 2 10 27 6 7 17 12 3 19 23 25 24 11 18 21 22 15 20 30 13 5 16 28 30 3 18 29 5 17 12 11 27 15 19 10 28 25 9 24 7 13 6 8 23 14 22 2 20 4 16 26 21 1 6 11 16 8 27 10 13 15 14 29 22 19 9 2 18 24 12 20 1 26 4 5 30 7 3 25 23 17 21 28 16 8 18 19 23 13 7 26 24 3 1 5 29 25 27 9 6 15 12 22 1...
result:
ok AC