Submission #2470587
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <queue> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> #include <string> #include <climits> #include <tuple> using namespace std; typedef long long ll; typedef pair<int,int> P; typedef tuple<int,int,int,int> T; int main(){ int n,m; cin>>n>>m; T corp[50000]; int x[50000],y[50000],z[50000]; for(int i=0;i<n;i++){ int a,b,c,d; cin>>a>>b>>c>>d; corp[i]=T(a,b,c,d); } for(int j=0;j<m;j++)cin>>x[j]>>y[j]>>z[j]; for(int j=0;j<m;j++){ int l=-1,r=n,mid; while(r-l>1){ mid=(l+r)/2; if(get<0>(corp[mid])>x[j])r=mid; else l=mid; } //cout<<"r1"<<r<<endl; if(r<=0){cout<<0<<endl;continue;} l=-1; while(r-l>1){ mid=(l+r)/2; if(get<1>(corp[mid])>y[j])r=mid; else l=mid; } //cout<<"r2"<<r<<endl; if(r<=0){cout<<0<<endl;continue;} l=-1; while(r-l>1){ mid=(l+r)/2; if(get<2>(corp[mid])>z[j])r=mid; else l=mid; } //cout<<"r3"<<r<<endl; if(r<=0){cout<<0<<endl;continue;} r--; cout<<get<3>(corp[r])<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Optimal Recommendations |
User | yokofu |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1425 Byte |
Status | WA |
Exec Time | 193 ms |
Memory | 2048 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 10-random-00.txt, 10-random-01.txt, 10-random-02.txt, 10-random-03.txt, 10-random-04.txt, 20-absW-00.txt, 20-absW-01.txt, 20-absW-02.txt, 20-absW-03.txt, 20-absW-04.txt, 30-balance-00.txt, 30-balance-01.txt, 30-balance-02.txt, 30-balance-03.txt, 30-balance-04.txt, 40-limit_dim-00.txt, 40-limit_dim-01.txt, 40-limit_dim-02.txt, 40-limit_dim-03.txt, 40-limit_dim-04.txt, 40-limit_dim-05.txt, 40-limit_dim-06.txt, Corner1.txt, Sample1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
10-random-00.txt | WA | 185 ms | 2048 KB |
10-random-01.txt | AC | 2 ms | 1024 KB |
10-random-02.txt | WA | 84 ms | 1664 KB |
10-random-03.txt | WA | 119 ms | 1920 KB |
10-random-04.txt | WA | 58 ms | 1152 KB |
20-absW-00.txt | WA | 168 ms | 1792 KB |
20-absW-01.txt | AC | 1 ms | 1024 KB |
20-absW-02.txt | WA | 84 ms | 1280 KB |
20-absW-03.txt | WA | 131 ms | 1664 KB |
20-absW-04.txt | WA | 48 ms | 1280 KB |
30-balance-00.txt | WA | 185 ms | 2048 KB |
30-balance-01.txt | AC | 2 ms | 1024 KB |
30-balance-02.txt | WA | 46 ms | 1408 KB |
30-balance-03.txt | WA | 101 ms | 1408 KB |
30-balance-04.txt | WA | 115 ms | 1920 KB |
40-limit_dim-00.txt | WA | 193 ms | 2048 KB |
40-limit_dim-01.txt | WA | 192 ms | 2048 KB |
40-limit_dim-02.txt | WA | 191 ms | 2048 KB |
40-limit_dim-03.txt | WA | 190 ms | 2048 KB |
40-limit_dim-04.txt | WA | 190 ms | 2048 KB |
40-limit_dim-05.txt | WA | 192 ms | 2048 KB |
40-limit_dim-06.txt | WA | 189 ms | 2048 KB |
Corner1.txt | WA | 2 ms | 1024 KB |
Sample1.txt | AC | 2 ms | 1024 KB |