제출 #887202

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887202		Minbaev	Stone Arranging 2 (JOI23_ho_t1)	C++17	100 / 100	203 ms	19936 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e9 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

void solve(){
	int n,m,k;
	
	cin>>n;
	
	vector<int>v(n);
	map<int,int>mp;
	for(int i = 0;i<n;i++){
		cin>>v[i];
		mp[v[i]] = i;
	}
	vector<int>ans(n);
	for(int i = 0;i<n;){
		int val = v[i];
		int r = mp[v[i]];
		for(;i<=r;i++)cout<<val<<"\n";
	}
	
	
	
	
	









}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int cnt=0;
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void solve()':
Main.cpp:35:8: warning: unused variable 'm' [-Wunused-variable]
   35 |  int n,m,k;
      |        ^
Main.cpp:35:10: warning: unused variable 'k' [-Wunused-variable]
   35 |  int n,m,k;
      |          ^
Main.cpp: In function 'int main()':
Main.cpp:72:6: warning: unused variable 'cnt' [-Wunused-variable]
   72 |  int cnt=0;
      |      ^~~

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40