Problem:
危ない橋
会津若松市よりずっと北に位置する会津古松村では、「ヤ橋(やばし)   」と呼ばれる橋が周辺の村へ移動する唯一の手段となっています。その橋は通行人が多いにも関わらず、今にも壊れそうなほど老朽化が進んでしまっています。
ヤ橋は 150 [kg] まで耐えられる強度を持っています。例えば、80 [kg] の人と 50 [kg] の人が同時に渡ることはできますが、80 [kg] の人が渡っているときに 90 [kg] の人が渡り始めると、ヤ橋は壊れてしまいます。
もしヤ橋が壊れてしまったら、会津古松村の人々は周辺の村へ移動する手段を失ってしまいます。そこで、村で唯一のプログラマーであるあなたは、村民の生活を守るために、橋の渡り方から橋が壊れるか否かを判定するプログラムを作成することにしました。
橋を渡る通行人の人数
n
(1 ≤
n
≤ 100)、各通行人の体重
m
i
(1 ≤
m
i
≤ 100)、橋を渡り始める時刻
a
i
、渡り終える時刻
b
i
(0 ≤
a
i
,
b
i
< 2
31
) を入力とし、橋が壊れない場合は“OK ”と出力し、壊れる場合は“NG ”と出力するプログラムを作成してください。なお、橋の上にいる通行人の体重の総和が 150 [kg] を超えてしまうとヤ橋は壊れてしまいます。また、
a
i
の時点で通行人は橋の上にいますが、
b
i
の時点では橋の上にいません。
Input
複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。各データセットは以下の形式で与えられます。
n
m
1
a
1
b
1
m
2
a
2
b
2
:
m
n
a
n
b
n
データセットの数は 1200 を超えません。
Output
入力データセットごとに、橋が壊れるか否かを1行に出力します。
Sample Input
3
80 0 30
50 5 25
90 27 50
3
80 0 30
70 5 25
71 30 50
0
Output for the Sample Input
NG
OK

Submitted solutions:

code_snippet: #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<iomanip>
#include <string>
#include <math.h>
using namespace std;
int main(){
    long long int n,m=0;
    string ans="OK";
    cin>>n;
    while(n!=0){
        m=0;
        ans="OK";
        vector<pair<long long int,long long int>> a(100000);
        for(int i=0;i<n;i++){
            cin>>a[2*i].second>>a[2*i].first>>a[2*i+1].first;
            a[2*i+1].second=-a[2*i].second;
        }
        sort(a.begin(),a.begin()+2*n);
        for(int i=0;i<2*n;i++){
            m+=a[i].second;
            if(m>150){
                ans="NG";
            }
        }
        cout<<ans<<endl;
        cin>>n;
    }
    return 0;
}
accuracy: 1
time_ms: 60
memory_kb: 4672
final_rank: 20

code_snippet: #include <iostream>
#include <algorithm>
#include <utility>

int n;
std::pair<unsigned int, int> arr[210];

int main() {
    while(std::cin >> n, n) {
        int m, a, b;
        for(int i = 0; i < n; ++i) {
            std::cin >> m >> a >> b;

            arr[i * 2] = std::make_pair(a, m);
            arr[i * 2 + 1] = std::make_pair(b, -m);
        }

        std::sort(arr, arr + n * 2);

        int w = 0;
        bool ok = true;
        for(int i = 0; i < n * 2; ++i) {
            w += arr[i].second;

            if(w > 150) {
                ok = false;
                break;
            }
        }

        std::cout << (ok ? "OK" : "NG") << std::endl;
    }
}
accuracy: 1
time_ms: 10
memory_kb: 1156
final_rank: 1

code_snippet: #include<iostream>
#include<algorithm>
using namespace std;
long long a[100],b[100],cha[200];
int main(){
	int n,m[100];
	while(true){
	cin>>n;
	if(n==0)break;
	for(int i=0;i<n;i++){
		cin>>m[i]>>a[i]>>b[i];
		cha[i*2]=a[i],cha[i*2+1]=b[i];
	}
	sort(cha,cha+n*2);
	bool ok=true;
	int w=0,bef=-1;
	for(int i=0;i<n*2;i++){
		if(bef!=cha[i]){
		for(int j=0;j<n;j++){
		if(cha[i]==a[j])
			w+=m[j];
		if(cha[i]==b[j])
			w-=m[j];
		}
		}
		bef=cha[i];
		if(w>150)
			ok=false;
	}
	if(ok)cout<<"OK"<<endl;
	else cout<<"NG"<<endl;
	}
	return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1184
final_rank: 4

code_snippet: #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>vec;
int N, x[1000], y[1000], w[1000];
int main() {
	while (true) {
		vec.clear();
		cin >> N;
		if (N == 0) { break; }
		for (int i = 0; i < N; i++) {
			cin >> w[i] >> x[i] >> y[i];
			int ok1 = 1, ok2 = 1;
			for (int j = 0; j < vec.size(); j++) {
				if (vec[i] == x[i]) { ok1 = 0; }
				if (vec[i] == y[i]) { ok2 = 0; }
			}
			if (ok1 == 1) { vec.push_back(x[i]); }
			if (ok2 == 1) { vec.push_back(y[i]); }
		}
		sort(vec.begin(), vec.end());
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < vec.size(); j++) {
				if (vec[j] == x[i]) { x[i] = j; break; }
			}
			for (int j = 0; j < vec.size(); j++) {
				if (vec[j] == y[i]) { y[i] = j; break; }
			}
		}
		int W = 0; int ok = 1;
		for (int i = 0; i < vec.size(); i++) {
			for (int j = 0; j < N; j++) {
				if (x[j] == i) { W += w[j]; }
				if (y[j] == i) { W -= w[j]; }
			}
			if (W > 150) { ok = 0; }
		}
		if (ok == 1) { cout << "OK" << endl; }
		if (ok == 0) { cout << "NG" << endl; }
	}
	return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1224
final_rank: 19

code_snippet: #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define fr first
#define sc second
#define Rep(i,n) for(int i=0;i<(n);i++)
#define Rrep(i, m, n) for(int i=(m);i<(n);i++)
#define All(v) v.begin(),v.end()
#define Uniq(v) v.erase(unique(All(v)),v.end())
typedef pair<int, int> Pii;
typedef pair<int, Pii> Pip;
typedef pair<string, int> Psi;
typedef vector<int> Vi;
const int INF = (1<<30);
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};

int main()
{
  int n;

  while( cin >> n, n ) {
    vector<Pip> v;
    bool flag = false;

    Rep(i, n) {
      int m, a, b;
      cin >> m >> a >> b;
      v.pb(Pip(a, Pii(b, m)));
    }
    sort(All(v));
    
    Rep(i, n) {
      Pip p = v[i];
      int m = p.sc.sc, a = p.fr, b = p.sc.fr;
      int sum = m;
      
      Rep(j, i) {
	Pip p_ = v[j];
	int m_ = p_.sc.sc, a_ = p_.fr, b_ = p_.sc.fr;
	if( b_ > a ) {
	  sum += m_;
	}
      }
      
      if( sum > 150 ) {
	flag = true;
      }
    }

    if( flag ) cout << "NG" << endl;
    else cout << "OK" << endl;
  }

}
accuracy: 1
time_ms: 10
memory_kb: 1188
final_rank: 5

code_snippet: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <functional>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>

#define rep(i, a) REP(i, 0, a)
#define REP(i, a, b) for(int i = a; i < b; ++i)
#define repll(i, a) REPLL(i, 0, a)
#define REPLL(i, a, b) for(ll i = a; i < b; ++i)

typedef long long ll;
typedef unsigned long long ull;
typedef std::pair<int, int> P;
typedef std::pair<P, int> PP;
const double PI = 3.14159265358979323846;
const double esp = 1e-9;
const int infi = (int)1e+9 + 10;
const ll infll = (ll)1e+17 + 10;

int n;
std::map<int, int> ind;
int dat[101], s[101], e[101];
int calc[105];

int main(){
	while (std::cin >> n, n){
		ind.clear();
		memset(dat, 0, sizeof(dat));
		memset(s, 0, sizeof(s));
		memset(e, 0, sizeof(e));
		memset(calc, 0, sizeof(calc));
		rep(i, n){
			std::cin >> dat[i] >> s[i] >> e[i];
			ind[s[i]] = 0;
			ind[e[i]] = 0;
		}

		int cnt = 0;
		for (auto it = ind.begin(); it != ind.end(); ++it){
			it->second = cnt;
			++cnt;
		}

		rep(i, n){
			calc[ind[s[i]]] += dat[i];
			calc[ind[e[i]]] -= dat[i];
		}

		bool flg = true;
		rep(i, ind.size()){
			if (i != 0)calc[i] += calc[i - 1];
			if (calc[i] > 150)flg = false;
		}
		std::cout << (flg ? "OK" : "NG") << std::endl;
	}
	return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1196
final_rank: 8

code_snippet: #include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define REP(i, n) FOR(i, 0, n)

//#define doutnl(args...) cout<<args
#define doutnl(...)
#define dout(args...) doutnl(args<<endl;)
#define dprintl(args...) dout("D:"<<__LINE__<<": " args)
#define dv(v) <<#v<<"="<<(v)<<"; "
typedef long long ll;

vector<pair<ll,ll> > ts;

int n;
int main(){
	while(true){
		ts.clear();
		cin>>n;
		if(n==0) break;
		REP(i,n){
			ll m,a,b;
			cin>>m>>a>>b;
			ts.push_back(pair<ll,ll>(a,m));
			ts.push_back(pair<ll,ll>(b,-m));
			
		}
		sort(ts.begin(),ts.end());
		ll w=0;
		bool flag=false;
		REP(i,ts.size()){
			w+=ts[i].second;
			if(i!=ts.size()-1&&ts[i].first!=ts[i+1].first){
				dprintl(dv(i)dv(ts[i].first)dv(ts[i].second)dv(w));
				if(w>150){flag=true;break;}
			}
		}
		cout<<(flag?"NG":"OK")<<endl;
	}
		
	return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1208
final_rank: 15

code_snippet: #include <bits/stdc++.h>
using namespace std;

#define for_(i,a,b) for(int i=(a);i<(b);++i)

int n, m[110];
vector< int > a, b;

int compress(vector< int >& x1, vector< int >& x2, int W) {
	vector< int > xs;
	
	for_(i,0,n) for_(j,-1,2) {
		int nx1 = x1[i] + j, nx2 = x2[i] + j;
		if (0 <= nx1 && nx1 < W) xs.push_back(nx1);
		if (0 <= nx2 && nx2 < W) xs.push_back(nx2);
	}
	
	sort(xs.begin(), xs.end());
	xs.erase(unique(xs.begin(), xs.end()), xs.end());
	
	for_(i,0,n) {
		x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin();
		x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin();
	}
	
	return xs.size();
}

int main() {
	while (cin >> n, n) {
		a.assign(n, 0); b.assign(n, 0);
		for_(i,0,n) cin >> m[i] >> a[i] >> b[i];
		
		long long W = (1LL << 31) - 1;
		int mm = compress(a, b, (int)W);
		
		vector< int > sum(mm + 10, 0);
		
		for_(i,0,n) {
			sum[a[i]] += m[i];
			sum[b[i]] += -m[i];
		}
		
		int maxs = sum[0];
		
		for_(i,1,mm+1) {
			sum[i] += sum[i - 1];
			maxs = max(maxs, sum[i]);
		}
		
		cout << (maxs > 150 ? "NG" : "OK") << endl;
	}
}
accuracy: 1
time_ms: 10
memory_kb: 1220
final_rank: 18

code_snippet: #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

int main(){
  int n;
  while(cin >> n, n){
    vector<pii> events(2*n);
    for(int i=0;i<n;i++){
      int m,a,b;
      cin >> m >> a >> b;
      events[2*i] = pii(a,m);
      events[2*i+1] = pii(b,-m);
    }
    sort(events.begin(), events.end());

    int sum = 0;
    bool ans = true;
    for(int i=0;i<2*n;i++){
      sum += events[i].second;
      if(sum > 150)ans = false;
    }

    cout << (ans ? "OK" : "NG") << endl;
  }
}
accuracy: 1
time_ms: 10
memory_kb: 1192
final_rank: 7

code_snippet: #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define INF 99999999



int main(){
    int n,a,b,c;
    while(cin>>n&&n){
        vector<pii> v;
        rep(i,n){
            cin>>a>>b>>c;
            v.pb(pii(b,a ));
            v.pb(pii(c,-a));
        }
        sort(all(v));
        int sum=0;
        bool f=false;
        rep(i,v.size()){
            sum+=v[i].second;
            if(sum>150){
                f=true;
                break;
            }
        }
        if(f)cout<<"NG"<<endl;
        else cout<<"OK"<<endl;
    }
}
accuracy: 1
time_ms: 10
memory_kb: 1196
final_rank: 8

code_snippet: #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> Pi;

int main(){
  int n;
  while(cin >> n , n){
    Pi event[n*2+1];
    for(int i=0;i<n;i++){
      int a,b,c;
      cin >> a >> b >> c;
      event[i].first = b;
      event[i].second.first = 1;
      event[i].second.second = a;
      event[i+n].first = c;
      event[i+n].second.first = 0;
      event[i+n].second.second = a;
    }
    sort(event,event+(n*2));
    int now=0;
    bool flg = false;
    for(int i=0;i<n*2;i++){
      if(event[i].second.first == 1) now += event[i].second.second;
      else now -= event[i].second.second;
      
      if(now > 150){
	flg = true;
	break;
      }
    }
    if(flg) cout << "NG" << endl;
    else cout << "OK" << endl;
  }
}
accuracy: 1
time_ms: 10
memory_kb: 1156
final_rank: 1

code_snippet: #include <iostream>
#include <algorithm>
using namespace std;

struct P {
  int m,a,sta;
  bool operator < (const P t ) const {
    if( a == t.a) return sta < t.sta;
    return a < t.a;
  }

};

int main() {

  while(1) {
  int n;
  cin >> n;
  if(n == 0) break;

  P ls[202];
  for(int i=0;i<2*n;i++) ls[i].sta = (i+1)%2;

  int b,c,d;
  for(int i=0;i<n;i++) {
    cin >> b >> c >> d;
    ls[i*2].m = b;
    ls[i*2+1].m = b;
    ls[i*2].a = c;
    ls[i*2+1].a = d;
  }


  sort(ls,ls+2*n);

  int sum = 0;
  int flg = 0;
  for(int i=0;i<2*n;i++) {
    if(ls[i].sta == 0) sum -= ls[i].m;
    if(ls[i].sta == 1)  sum += ls[i].m;
    if(sum > 150) {
      flg = 1;
      break;
    }
  }

  if(flg == 0) cout <<"OK"<<endl;
  else cout <<"NG"<<endl;

  }

  return 0;

}
accuracy: 1
time_ms: 10
memory_kb: 1180
final_rank: 3

code_snippet: #include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  while(cin >> n, n) {
    vector<pair<int, int> > ps;
    for(int i = 0; i < n; ++i) {
      int m, a, b;
      cin >> m >> a >> b;
      ps.push_back(make_pair(a, m));
      ps.push_back(make_pair(b, -m));
    }
    sort(begin(ps), end(ps));
    int cweight = 0;
    bool result = true;
    for(int i = 0; i < ps.size(); ++i) {
      cweight += ps[i].second;
      if(i < ps.size() - 1 && ps[i + 1].first == ps[i].first) continue;
      if(cweight > 150) {
        result = false;
        break;
      }
    }
    cout << (result ? "OK" : "NG") << endl;
  }
  return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1196
final_rank: 8

code_snippet: #include <bits/stdc++.h>
using namespace std;

typedef pair<double,int> P;

int main() {
  int n;
  while(cin >> n && n) {
    vector<P> a;
    for(int i=0; i<n; i++) {
      int x,y,z;
      cin >> x >> y >> z;
      a.push_back(P(y,x));
      a.push_back(P((double)z-0.1,-x));
    }
    sort(a.begin(),a.end());
    int w=0;
    bool f=0;
    for(int i=0; i<a.size(); i++) {
      w+=a[i].second;
      if(w>150) f=1;
    }
    if(f) cout << "NG" << endl;
    else cout << "OK" << endl;
  }
  return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1200
final_rank: 12

code_snippet: #include <iostream>
#include <utility>
#include <vector>
using namespace std;

#define fi first
#define se second

struct s {
	int m, a, b;
	s() {}
	s(int m_, int a_, int b_) {
		m = m_; a = a_; b = b_;
	}
};

int main() {
	int n;
	while(cin >> n, n) {
		vector
 v;
		vector<int> t;
		for(int i = 0; i < n; i++) {
			int m, a, b;
			cin >> m >> a >> b;
			v.push_back(s(m, a, b));
			t.push_back(a);
			t.push_back(b);
		}

		bool flg = true;
		for(int i = 0; i < t.size(); i++) {
			int sum = 0;
			for(int j = 0; j < n; j++) {
				if(v[j].a <= t[i] && t[i] < v[j].b)
					sum += v[j].m;
			}
			if(sum > 150)
				flg = false;
		}
		if(flg)
			cout << "OK" << endl;
		else
			cout << "NG" << endl;
	}
}
accuracy: 1
time_ms: 10
memory_kb: 1212
final_rank: 16

code_snippet: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iterator>
#include <map>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

struct Time
{
	int t,cost;

	Time(int _t,int _cost)
	{
		t = _t;
		cost = _cost;
	}

	bool operator<(const Time &ti) const
	{
		return t < ti.t;
	}
};

int main()
{
	int n;
	while(cin >> n && n)
	{
		map<int,int> ma;

		rep(i,n)
		{
			int m,a,b;
			cin >> m >> a >> b;

			ma[a] += m;
			ma[b] -= m;
		}

		vector<Time> v;
		map<int,int>::iterator ite;
		for(ite = ma.begin();ite != ma.end();ite++)
		{
			v.push_back(Time(ite->first,ite->second));	
		}

		sort(v.begin(),v.end());
		vector<int> res;
		res.resize(v.size());
		
		int temp = 0;

		rep(i,v.size())
		{
			temp += v[i].cost;
			res[i] = temp;
		}

		bool flag = true;
		rep(i,res.size())
		{
			if(res[i] > 150) flag = false;
		}


		if(flag) cout << "OK" << endl;
		else cout << "NG" << endl;

	}

	return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1200
final_rank: 12

code_snippet: #include <iostream>
#include <string>
#include <vector>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
using namespace std;

int main() {
    int n;
    while (cin >> n, n) {
        vector<int> m(n), a(n), b(n);
        vector<int> x;
        for (int i=0; i<n; ++i) {
            cin >> m[i] >> a[i] >> b[i];
            x.push_back(a[i]);
            x.push_back(b[i]);
        }
        sort(x.begin(), x.end());
        x.erase(unique(x.begin(), x.end()), x.end());

        int sum[300] = {};
        for (int i=0; i<n; ++i) {
            int a2 = lower_bound(x.begin(), x.end(), a[i]) - x.begin();
            int b2 = lower_bound(x.begin(), x.end(), b[i]) - x.begin();
            sum[a2] += m[i];
            sum[b2] -= m[i];
        }

        bool ok = true;
        for (int i=0; i<300; ++i) {
            sum[i] += (i == 0 ? 0 : sum[i-1]);
            if (150 < sum[i]) {
                ok = false;
                break;
            }
        }
        cout << (ok ? "OK" : "NG") << endl;
    }
    return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1212
final_rank: 16

code_snippet: #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;

int main() {
  int N;
  while(cin >>N && N){
    bool f = true;
    vector<int> M(N), A(N), B(N);
    REP(i, N) cin >>M[i] >>A[i] >>B[i];
    REP(i, N){
      int sum = 0;
      REP(j, N) if(A[j] <= A[i] && A[i] < B[j]) sum += M[j];
      if(sum > 150) f = false;
    }
    cout <<(f ? "OK" : "NG") <<endl;
  }
  return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1188
final_rank: 5

code_snippet: #include <iostream>
#include <map>
using namespace std;

int main(void) {
  while (1) {
    int n;
    cin >> n;
    if (n == 0) break;

    map<int, int> bridge;
    bridge[-1] = 0;
    while (n--) {
      int m, a, b;
      cin >> m >> a >> b;
      if (bridge.find(a) == bridge.end()) {
        bridge[a] = m;
      } else {
        bridge[a] += m;
      }
      if (bridge.find(b) == bridge.end()) {
        bridge[b] = -m;
      } else {
        bridge[b] -= m;
      }
    }

    bool flag = false;
    map<int, int>::iterator b_iter = bridge.begin(), iter = bridge.begin();
    iter++;
    while (iter != bridge.end()) {
      iter->second += b_iter->second;
      //cout << "# bridge[" << iter->first << "]: " << iter->second << endl;
      if (iter->second > 150) {
        flag = true;
        break;
      }
      b_iter++;
      iter++;
    }

    if (flag) {
      cout << "NG" << endl;
    } else {
      cout << "OK" << endl;
    }
  }
  return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 1196
final_rank: 8

code_snippet: #include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#define pb push_back
#define fi first
#define sc second
using namespace std;
int main()
{
	while(1)
	{
		int n; cin >> n;
		if(n == 0) return 0;
		map<long long,vector<int> >ma;
		for(int i=0;i<n;i++)
		{
			long long a,b,c;
			cin >> a >> b >> c;
			ma[b*2].push_back(a);
			ma[c*2-1].push_back(a);
		}
		int cur = 0;
		for(map<long long,vector<int> >::iterator it = ma.begin();it!=ma.end();++it)
		{
			if((it->fi)%2==0) for(int i=0;i<(it->sc).size();i++) cur += (it->sc)[i];
			else for(int i=0;i<(it->sc).size();i++) cur -= (it->sc)[i];
			if(cur>150) goto dead;
		}
		puts("OK"); continue; dead:; puts("NG");
	}
}
accuracy: 1
time_ms: 10
memory_kb: 1200
final_rank: 12